共 50 条
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
来源:
关键词:
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
相关论文