Generalization of two results of Hilton on total-colourings of a graph

DOI10.1016/0012-365X(94)00291-PzbMath0824.05025MaRDI QIDQ1893175

Hian Poh Yap

Publication date: 9 November 1995

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

zbMATH Keywords

maximal matchingtotal colouringtotal chromatic numberresults of Hilton

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

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

Cites Work

• Unnamed Item
• Unnamed Item
• The total chromatic number of graphs having large maximum degree
• A total-chromatic number analogue of Plantholt's theorem
• The total chromatic number of nearly complete bipartite graphs
• Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
• The total chromatic number of regular graphs whose complement is bipartite
• Total Colourings of Graphs
• Total chromatic number of completer-partite graphs
• Nombre Chromatique Total Du Graphe R -Parti Complet
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Complementary Graphs and Edge Chromatic Numbers

This page was built for publication: Generalization of two results of Hilton on total-colourings of a graph