A New Upper Bound for the List Chromatic Number
Abstract
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
Recommended Citation
Bollobás, B., & Hind, H. (1989). A New Upper Bound for the List Chromatic Number. Annals of Discrete Mathematics, 39 (C), 65-75. https://doi.org/10.1016/S0167-5060(08)70299-1
COinS
