z-logo
open-access-imgOpen Access
Mycielskians and matchings
Author(s) -
Akbar Ali
Publication year - 2005
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1279
Subject(s) - mathematics , combinatorics
It is shown in this note that some matching-related properties of graphs, such as their factor-criticality, regularizability and the existence of perfect $2$-matchings, are preserved when iterating Mycielski's construction.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom