Total chromatic number of completer-partite graphs

DOI10.1002/JGT.3190160608zbMATH Open0776.05044OpenAlexW2011104063MaRDI QIDQ4016026

No author found.

Publication date: 17 December 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190160608

zbMATH Keywords

total chromatic numbercomplete \(r\)-partite graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item

Related Items (8)

Total-colorings of complete multipartite graphs using amalgamations ⋮ Generalization of two results of Hilton on total-colourings of a graph ⋮ The total chromatic number of complete multipartite graphs with low deficiency ⋮ Minimum total coloring of planar graph ⋮ On total chromatic number of complete multipartite graphs ⋮ Total colorings of complete multipartite graphs using amalgamations ⋮ The total chromatic number of regular graphs of high degree ⋮ The total chromatic number of some bipartite graphs

This page was built for publication: Total chromatic number of completer-partite graphs