Mycielskians and matchings
Discussiones Mathematicae. Graph Theory, Tome 25 (2005) no. 3, pp. 261-266
Cet article a éte moissonné depuis la source Library of Science
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
@article{DMGT_2005_25_3_a4,
author = {Dosli\'c, Tomislav},
title = {Mycielskians and matchings},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {261--266},
year = {2005},
volume = {25},
number = {3},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_2005_25_3_a4/}
}
Doslić, Tomislav. Mycielskians and matchings. Discussiones Mathematicae. Graph Theory, Tome 25 (2005) no. 3, pp. 261-266. http://geodesic.mathdoc.fr/item/DMGT_2005_25_3_a4/
[1] 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.
[2] 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.
[3] L. Lovász and M.D. Plummer, Matching Theory, Ann. Discr. Math. 29 (North-Holland, Amsterdam, The Netherlands, 1986).
[4] J. Mycielski, Sur le coloriage des graphes, Colloq. Math. 3 (1955) 161-162.