Total chromatic number of graphs of odd order and high degree

DOI10.1016/S0012-365X(99)00034-5zbMath0944.05045OpenAlexW1983895551MaRDI QIDQ1301827

V. Pereyra

Publication date: 12 September 1999

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00034-5

zbMATH Keywords

total chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

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

Cites Work

• 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
• 1-factorizing regular graphs of high degree - an improved bound
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• Total colourings of graphs
• Total chromatic number of regular graphs of odd order and high degree
• The Total Chromatic Number of Graphs of High Minimum Degree
• Total Chromatic Number of Graphs of Order 2n + l having Maximum Degree 2n − 1
• The Colour Numbers of Complete Graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Some Theorems on Abstract Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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