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.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1279, author = {Tomislav Dosli\'c}, title = {Mycielskians and matchings}, journal = {Discussiones Mathematicae Graph Theory}, volume = {25}, year = {2005}, pages = {261-266}, zbl = {1121.05047}, language = {en}, url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1279} }
Tomislav Doslić. Mycielskians and matchings. Discussiones Mathematicae Graph Theory, Tome 25 (2005) pp. 261-266. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1279/
[000] [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. | Zbl 0906.05043
[001] [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. | Zbl 0830.05027
[002] [3] L. Lovász and M.D. Plummer, Matching Theory, Ann. Discr. Math. 29 (North-Holland, Amsterdam, The Netherlands, 1986).
[003] [4] J. Mycielski, Sur le coloriage des graphes, Colloq. Math. 3 (1955) 161-162.