Edge-chromatic numbers of Mycielski graphs

DOI10.1016/j.disc.2011.12.011zbMath1270.05045OpenAlexW2075144563MaRDI QIDQ409467

Young Soo Kwon, Jaeun Lee, Zhong Fu Zhang

Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.12.011

zbMATH Keywords

Mycielski graphedge-chromatic numberbase graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Total chromatic number of generalized Mycielski graphs ⋮ Graph classes generated by Mycielskians ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs

Cites Work

• Unnamed Item
• Méthode et théorème général de coloration des aretes d'un multigraphe
• Circular chromatic numbers of Mycielski's graphs
• Planar graphs of maximum degree seven are Class I
• Circular chromatic number for iterated Mycielski graphs
• Fractional chromatic numbers of cones over graphs
• The NP-Completeness of Edge-Coloring
• The fractional chromatic number of mycielski's graphs
• On Representatives of Subsets
• Sur le coloriage des graphs
• Circular chromatic number and Mycielski graphs
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: Edge-chromatic numbers of Mycielski graphs