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...

Celý popis

Podrobná bibliografia

Vydané v:	Discrete Applied Mathematics Ročník 377; s. 445 - 458
Hlavní autori:	Dalal, Aseem, Panda, B.S.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.12.2025
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!