Total chromatic number of generalized Mycielski graphs

DOI10.1016/j.disc.2014.06.010zbMath1298.05109OpenAlexW4293505545MaRDI QIDQ396736

Xiaofeng Guo, Meirun Chen, Hao Li, Lian Zhu Zhang

Publication date: 14 August 2014

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

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

zbMATH Keywords

edge coloringtotal chromatic numbertotal coloringedge-chromatic numbergeneralized Mycielski graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Total colorings-a survey ⋮ Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\) ⋮ On adjacent vertex-distinguishing total chromatic number of generalized Mycielski graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Edge-chromatic numbers of Mycielski graphs
• The total chromatic number of graphs having large maximum degree
• An upper bound for total colouring of graphs
• Determining the total colouring number is NP-hard
• Méthode et théorème général de coloration des aretes d'un multigraphe
• Circular chromatic numbers of Mycielski's graphs
• Total colouring regular bipartite graphs is NP-hard
• Circular chromatic number and a generalization of the construction of Mycielski.
• Circular chromatic number for iterated Mycielski graphs
• Fractional chromatic numbers of cones over graphs
• The fractional chromatic number of mycielski's graphs
• The Colour Numbers of Complete Graphs
• Sur le coloriage des graphs
• Circular chromatic number and Mycielski graphs

This page was built for publication: Total chromatic number of generalized Mycielski graphs