On total chromatic number of complete multipartite graphs

In 1995, Hoffman and Rodger conjectured that the total chromatic number χ′′(K) of the complete p-partite graph K=K(r1,…,rp) is Δ(K)+1 if and only if K≠Kr,r and if K has an even number of vertices then def(K)=Σv∈V(K)(Δ(K)−dK(v)) is at least the number of parts of odd size. The conjecture is known to...

Full description

Bibliographic Details

Published in:	Discrete Applied Mathematics Vol. 377; pp. 445 - 458
Main Authors:	Dalal, Aseem, Panda, B.S.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.12.2025
Subjects:	Complete multipartite graphs Edge coloring Graph amalgamations Total coloring of graphs Graph amalgamations Complete multipartite graphs Total coloring of graphs Edge coloring
ISSN:	0166-218X
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!