The total chromatic number of graphs of even order and high degree

DOI10.1016/S0012-365X(03)00049-9zbMath1032.05056MaRDI QIDQ1408886

Wanlian Yang, Dezheng Xie

Publication date: 25 September 2003

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

zbMATH Keywords

total colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Total-colorings of complete multipartite graphs using amalgamations ⋮ The total chromatic number of regular graphs of high degree ⋮ The total chromatic number of regular graphs of even order and high degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The total chromatic number of graphs having large maximum degree
• Recent results on the total chromatic number
• A total-chromatic number analogue of Plantholt's theorem
• Hamiltonism, degree sum and neighborhood intersections
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• Total chromatic number of graphs of odd order and high degree
• The total chromatic number of any multigraph with maximum degree five is at most seven
• Generalization of two results of Hilton on total-colourings of a graph
• Total colourings of graphs
• The Total Chromatic Number of Graphs of High Minimum Degree
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY

This page was built for publication: The total chromatic number of graphs of even order and high degree