2005/01/01 by Tomislav DošliĆ · 1 citation
Computer Science · Mathematics · #Topological and Geometric Data Analysis #Advanced Graph Theory Research #Graph theory and applications #Mathematics #Combinatorics
paper · pdf · doi:10.7151/dmgt.1279
openalex publication_date 2005/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/05/19
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.