List-Coloring Claw-Free Graphs with Small Clique Number

被引：0
|
作者：
Louis Esperet
András Gyárfás
Frédéric Maffray
机构：
[1] CNRS/Grenoble-INP/UJF-Grenoble 1,
[2] G-SCOP (UMR5272),undefined
[3] Rényi Institute,undefined
来源：
Graphs and Combinatorics | 2014年 / 30卷
关键词：
Claw-free graphs; Chromatic number; List coloring;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Chudnovsky and Seymour proved that every connected claw-free graph that contains a stable set of size 3 has chromatic number at most twice its clique number. We improve this for small clique size, showing that every claw-free graph with clique number at most 3 is 4-choosable and every claw-free graph with clique number at most 4 is 7-choosable. These bounds are tight.
引用
收藏
页码：365 / 375
页数：10
相关论文
共 50 条
  • [21] List monopolar partitions of claw-free graphs
    Churchley, Ross
    Huang, Jing
    DISCRETE MATHEMATICS, 2012, 312 (17) : 2545 - 2549
  • [22] On list-coloring outerplanar graphs
    Hutchinson, Joan P.
    JOURNAL OF GRAPH THEORY, 2008, 59 (01) : 59 - 74
  • [23] List-coloring embedded graphs
    Dvorak, Zdenek
    Kawarabayashi, Ken-ichi
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1004 - 1012
  • [24] Coloring vertices of claw-free graphs in three colors
    Lozin, Vadim
    Purcell, Christopher
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 28 (02) : 462 - 479
  • [25] Coloring vertices of claw-free graphs in three colors
    Vadim Lozin
    Christopher Purcell
    Journal of Combinatorial Optimization, 2014, 28 : 462 - 479
  • [26] On the Complexity of Local-Equitable Coloring in Claw-Free Graphs with Small Degree
    Liang, Zuosong
    GRAPHS AND COMBINATORICS, 2024, 40 (05)
  • [27] Traceability in small claw-free graphs
    Harris, John M.
    Mossinghoff, Michael J.
    UTILITAS MATHEMATICA, 2006, 70 : 263 - 271
  • [28] Factors with Red–Blue Coloring of Claw-Free Graphs and Cubic Graphs
    Michitaka Furuya
    Mikio Kano
    Graphs and Combinatorics, 2023, 39
  • [29] Minimum weighted clique cover on claw-free perfect graphs
    Bonomo, Flavia
    Oriolo, Gianpaolo
    Snels, Claudia
    JOURNAL OF GRAPH THEORY, 2021, 96 (02) : 231 - 268
  • [30] Clique covering and degree conditions for hamiltonicity in claw-free graphs
    Favaron, O
    Flandrin, E
    Li, H
    Ryjácek, Z
    DISCRETE MATHEMATICS, 2001, 236 (1-3) : 65 - 80
12345