Mycielskians and matchings
From MaRDI portal
Publication:5492641
DOI10.7151/DMGT.1279zbMath1121.05047OpenAlexW2077810044MaRDI QIDQ5492641
Publication date: 16 October 2006
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0f1aa10efe72e67fe579cf614278a127314a1dfd
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items (6)
Packing chromatic number versus chromatic and clique number ⋮ Independence number and packing coloring of generalized Mycielski graphs ⋮ On ordinary and weighted Harary indices of Mycielski graphs ⋮ The exponential growth of the packing chromatic number of iterated Mycielskians ⋮ On tight components and anti-tight components ⋮ Graph classes generated by Mycielskians
This page was built for publication: Mycielskians and matchings
