An upper bound for the total chromatic number of dense graphs
From MaRDI portal
Publication:4013421
DOI10.1002/jgt.3190160302zbMath0767.05048OpenAlexW2000581481MaRDI QIDQ4013421
No author found.
Publication date: 27 September 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160302
Related Items (5)
Extending fixed vertex-colourings to total colourings ⋮ The total chromatic number of graphs having large maximum degree ⋮ Recent results on the total chromatic number ⋮ Recent developments in total colouring ⋮ Some colouring problems for Paley graphs
Cites Work
This page was built for publication: An upper bound for the total chromatic number of dense graphs
