Recent developments in total colouring

DOI10.1016/0012-365X(94)90162-7zbMath0796.05038MaRDI QIDQ1322273

V. Pereyra

Publication date: 9 June 1994

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

zbMATH Keywords

total chromatic numbertotal coloring conjecturetotal graph colorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The total graph of a hypergraph ⋮ Extending fixed vertex-colourings to total colourings

Cites Work

• Unnamed Item
• Unnamed Item
• The total chromatic number of graphs having large maximum degree
• Determining the total colouring number is NP-hard
• On total 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
• An upper bound for the total chromatic number of dense graphs
• Some upper bounds on the total and list chromatic numbers of multigraphs
• Nombre Chromatique Total Du Graphe R -Parti Complet
• The Colour Numbers of Complete Graphs
• SOME UNSOLVED PROBLEMS IN GRAPH THEORY
• Complementary Graphs and Edge Chromatic Numbers

This page was built for publication: Recent developments in total colouring