Download PDF - Mycielskians and matchings
ArticleOriginal scientific text
Title
Mycielskians and matchings
Authors 1
Affiliations
- Department of Informatics and Mathematics, Faculty of Agriculture, University of Zagreb, Svetosimunska c. 25, 10000 Zagreb, Croatia
Abstract
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.
Keywords
Mycielskian, factor-critical graph, perfect matching, perfect 2-matching
Bibliography
- D.C. Fisher, P. McKenna and E.D. Boyer, Hamiltonicity, diameter, domination, packing and biclique partitions of Mycielski's graphs, Discrete Appl. Math. 84 (1998) 93-105, doi: 10.1016/S0166-218X(97)00126-1.
- M. Larsen, J. Propp and D. Ullman, The fractional chromatic number of Mycielski's graphs, J. Graph Theory 19 (1995) 411-416, doi: 10.1002/jgt.3190190313.
- L. Lovász and M.D. Plummer, Matching Theory, Ann. Discr. Math. 29 (North-Holland, Amsterdam, The Netherlands, 1986).
- J. Mycielski, Sur le coloriage des graphes, Colloq. Math. 3 (1955) 161-162.
Pages:
261-266
Main language of publication
English
Received
2003-07-15
Accepted
2004-07-23
Published
2005
DOI: 10.7151/dmgt.1279
Exact and natural sciences