The total chromatic number of regular graphs whose complement is bipartite

DOI10.1016/0012-365X(94)90255-0zbMath0794.05028MaRDI QIDQ1318798

Anthony J. W. Hilton, J. Keith Dugdale

Publication date: 4 April 1994

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

zbMATH Keywords

bipartitetype1-factorNP-completesimple graphtotal chromatic numbertotal coloringmaximum vertex degreeregular simple graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (3)

Total chromatic number of honeycomb network ⋮ Generalization of two results of Hilton on total-colourings of a graph ⋮ Recent results on the total chromatic number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• A total-chromatic number analogue of Plantholt's theorem
• Partial triple systems and edge colourings
• Alternating Hamiltonian circuits in edge-coloured bipartite graphs
• The total coloring of a multigraph with maximal degree 4
• An upper bound for the total chromatic number
• The Total Chromatic Number of Graphs of High Minimum Degree
• Complementary Graphs and Edge Chromatic Numbers

This page was built for publication: The total chromatic number of regular graphs whose complement is bipartite