The total chromatic number of complete multipartite graphs with low deficiency

DOI10.1007/S00373-014-1503-4zbMath1330.05062OpenAlexW2030247046MaRDI QIDQ897273

C. A. Rodger, Aseem Dalal

Publication date: 17 December 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-014-1503-4

zbMATH Keywords

total chromatic numbercomplete multipartite graphstype one

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Total-colorings of complete multipartite graphs using amalgamations ⋮ Total colorings-a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Class one graphs
• Canonical edge-colourings of locally finite graphs
• Hamilton decompositions of complete graphs with a 3-factor leave.
• Total Colourings of Graphs
• The chromatic index of complete multipartite graphs
• Total chromatic number of completer-partite graphs
• Nombre Chromatique Total Du Graphe R -Parti Complet

This page was built for publication: The total chromatic number of complete multipartite graphs with low deficiency