An upper bound for total colouring of graphs

DOI10.1016/0012-365X(93)90175-SzbMath0786.05035OpenAlexW2063433483MaRDI QIDQ686500

Abdón Sánchez-Arroyo, Colin J. H. McDiarmid

Publication date: 25 April 1994

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

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90175-s

zbMATH Keywords

upper boundtotal chromatic numbertotal coloring

Mathematics Subject Classification ID

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

Related Items (3)

Simultaneously colouring the edges and faces of plane graphs ⋮ Total chromatic number of generalized Mycielski graphs ⋮ A new upper bound for total colourings of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On total colourings of graphs
• An upper bound for the total chromatic number
• On the total coloring of certain graphs
• Path-Partition Structures of Graphs and Digraphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Complementary Graphs and Edge Chromatic Numbers

This page was built for publication: An upper bound for total colouring of graphs