Mycielskians and matchings

Tomislav DošliĆ · Discussiones Mathematicae Graph Theory · 2005

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.

Read the paper · More papers on PaperTik