Extending fixed vertex-colourings to total colourings

DOI10.1016/S0012-365X(97)00013-7zbMath0888.05028WikidataQ126654385 ScholiaQ126654385MaRDI QIDQ1377889

Stephen A. Wong

Publication date: 25 May 1998

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

zbMATH Keywords

total colouringvertex-colouring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• List-colourings of graphs
• Recent developments in total colouring
• An upper bound for the total chromatic number
• The Total Chromatic Number of Graphs of High Minimum Degree
• An upper bound for the total chromatic number of dense graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Complementary Graphs and Edge Chromatic Numbers

This page was built for publication: Extending fixed vertex-colourings to total colourings