A New Upper Bound for the List Chromatic Number


For large values of Δ, it is shown that all Δ-regular finite simple graphs possess a non-trivial vertex partition. This is then used to show that for finite simple graphs of maximal degree Δ(G) = Δ, the list chromatic number is bounded by χ(G) ⩽ 7Δ/4 + o(Δ). © 1989, Elsevier Inc. All rights reserved.

Publication Title

Annals of Discrete Mathematics