The Total Chromatic Number of Graphs of High Minimum Degree

DOI10.1112/jlms/s2-44.2.193zbMath0753.05033OpenAlexW2044410117WikidataQ59233614 ScholiaQ59233614MaRDI QIDQ4009489

Zhao Cheng, Amanda G. Chetwynd, Anthony J. W. Hilton

Publication date: 27 September 1992

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/s2-44.2.193

zbMATH Keywords

total chromatic numbergraph of high minimum degree

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Total chromatic number of regular graphs of odd order and high degree ⋮ Extending fixed vertex-colourings to total colourings ⋮ Total colorings-a survey ⋮ The total chromatic number of graphs of even order and high degree ⋮ On total coloring the direct product of cycles and bipartite direct product of graphs ⋮ The total chromatic number of nearly complete bipartite graphs ⋮ The total chromatic number of graphs having large maximum degree ⋮ Recent results on the total chromatic number ⋮ The total chromatic number of regular graphs of even order and high degree ⋮ Total chromatic number of graphs of odd order and high degree ⋮ The total chromatic number of regular graphs whose complement is bipartite ⋮ Recent developments in total colouring

This page was built for publication: The Total Chromatic Number of Graphs of High Minimum Degree