Edge-chromatic numbers of Mycielski graphs

DOI10.1016/J.DISC.2011.12.011MaRDI QIDQ409467zbMATH OpenOpenAlexFDO

Authors Young Soo Kwon, Jaeun Lee, Zhongfu 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

edge-chromatic numberbase graphMycielski graph

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3273761 (Why is no real title available?)
• Circular chromatic number and Mycielski graphs
• Circular chromatic number for iterated Mycielski graphs
• Circular chromatic numbers of Mycielski's graphs
• Every planar graph with maximum degree 7 is of class 1
• Fractional chromatic numbers of cones over graphs
• Méthode et théorème général de coloration des aretes d'un multigraphe
• On Representatives of Subsets
• Planar graphs of maximum degree seven are Class I
• Sur le coloriage des graphs
• The NP-Completeness of Edge-Coloring
• The fractional chromatic number of mycielski's graphs

Cited in

(6)

• Graph classes generated by Mycielskians
• scientific article; zbMATH DE number 5951674 (Why is no real title available?)
• Total chromatic number of generalized Mycielski graphs
• The edge chromatic number of a directed/mixed multigraph
• scientific article; zbMATH DE number 5525275 (Why is no real title available?)
• On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409467)