The total chromatic number of nearly complete bipartite graphs

DOI10.1016/0095-8956(91)90085-XzbMath0743.05022OpenAlexW1980134418MaRDI QIDQ1179463

Anthony J. W. Hilton

Publication date: 26 June 1992

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(91)90085-x

zbMATH Keywords

complete bipartite graphtotal chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (7)

On the Total Chromatic Edge Stability Number and the Total Chromatic Subdivision Number of Graphs ⋮ Generalization of two results of Hilton on total-colourings of a graph ⋮ The hunting of a snark with total chromatic number 5 ⋮ Recent results on the total chromatic number ⋮ On the total and AVD-total coloring of graphs ⋮ A study of the total chromatic number of equibipartite graphs ⋮ Total colouring regular bipartite graphs is NP-hard

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A total-chromatic number analogue of Plantholt's theorem
• List-colourings of graphs
• An upper bound for the total chromatic number
• A note on list-colorings
• 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 nearly complete bipartite graphs