Total chromatic number of regular graphs of odd order and high degree

DOI10.1016/0012-365X(95)00034-TzbMath0866.05023WikidataQ114215607 ScholiaQ114215607MaRDI QIDQ1918537

Yanyan Li

Publication date: 22 August 1996

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

zbMATH Keywords

total chromatic numbertotal coloringtotal coloring conjectureconformable graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Total colorings-a survey ⋮ On total coloring the direct product of cycles and bipartite direct product of graphs ⋮ Total chromatic number of graphs of odd order and high degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The total chromatic number of graphs having large maximum degree
• Recent results on the total chromatic number
• 1-factorizing regular graphs of high degree - an improved bound
• The Total Chromatic Number of Graphs of High Minimum Degree
• Regular Graphs of High Degree are 1-Factorizable
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Complementary Graphs and Edge Chromatic Numbers
• Some Theorems on Abstract Graphs

This page was built for publication: Total chromatic number of regular graphs of odd order and high degree