Edge-chromatic numbers of Mycielski graphs

DOI10.1016/J.DISC.2011.12.011zbMATH Open1270.05045OpenAlexW2075144563MaRDI QIDQ409467FDOQ409467

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

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

Cited In (6)

• Title not available (Why is that?)
• The edge chromatic number of a directed/mixed multigraph
• Total chromatic number of generalized Mycielski graphs
• Title not available (Why is that?)
• On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs
• Graph classes generated by Mycielskians

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)