Bounds Related to The Edge-List Chromatic and Total Chromatic Numbers of a Simple Graph

preprint2022arXivOpen access

Abstract

We show that for a simple graph GG, c′(G)≤Δ(G)+2c'(G)\leqΔ(G)+2 where c′(G)c'(G) is the choice index (or edge-list chromatic number) of GG, and Δ(G)Δ(G) is the maximum degree of GG. As a simple corollary of this result, we show that the total chromatic number χT(G)χ_T(G) of a simple graph satisfies the inequality χT(G)≤ Δ(G)+4χ_T(G)\leq\ Δ(G)+4 and the total choice number cT(G)c_T(G) also satisfies this inequality. We also relate these bounds to the Hall index and the Hall condition index of a simple graph, and to the total Hall number and the total Hall condition number of a simple graph.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.