A new upper bound for total colourings of graphs

DOI10.1016/0012-365X(94)00219-9zbMath0824.05022OpenAlexW2063114607MaRDI QIDQ1842182

Abdón Sánchez-Arroyo

Publication date: 26 October 1995

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

Full work available at URL: https://doi.org/10.1016/0012-365x(94)00219-9

zbMATH Keywords

upper boundtotal colouringtotal chromatic number

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: A new upper bound for total colourings of graphs