List-Coloring Claw-Free Graphs with Small Clique Number

Louis Esperet, A. Gyárfás, Frédéric Maffray

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)365-375
Number of pages11
JournalGraphs and Combinatorics
Volume30
Issue number2
DOIs
Publication statusPublished - Mar 2014

Fingerprint

List Coloring
Clique number
Claw-free Graphs
Coloring
Stable Set
Chromatic number
Clique
Connected graph

Keywords

  • Chromatic number
  • Claw-free graphs
  • List coloring

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

List-Coloring Claw-Free Graphs with Small Clique Number. / Esperet, Louis; Gyárfás, A.; Maffray, Frédéric.

In: Graphs and Combinatorics, Vol. 30, No. 2, 03.2014, p. 365-375.

Research output: Contribution to journalArticle

Esperet, Louis ; Gyárfás, A. ; Maffray, Frédéric. / List-Coloring Claw-Free Graphs with Small Clique Number. In: Graphs and Combinatorics. 2014 ; Vol. 30, No. 2. pp. 365-375.
@article{7cb71894a85a422095fa14bfd7004239,
title = "List-Coloring Claw-Free Graphs with Small Clique Number",
abstract = "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.",
keywords = "Chromatic number, Claw-free graphs, List coloring",
author = "Louis Esperet and A. Gy{\'a}rf{\'a}s and Fr{\'e}d{\'e}ric Maffray",
year = "2014",
month = "3",
doi = "10.1007/s00373-012-1272-x",
language = "English",
volume = "30",
pages = "365--375",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "2",

}

TY - JOUR

T1 - List-Coloring Claw-Free Graphs with Small Clique Number

AU - Esperet, Louis

AU - Gyárfás, A.

AU - Maffray, Frédéric

PY - 2014/3

Y1 - 2014/3

N2 - 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.

AB - 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.

KW - Chromatic number

KW - Claw-free graphs

KW - List coloring

UR - http://www.scopus.com/inward/record.url?scp=84894346886&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84894346886&partnerID=8YFLogxK

U2 - 10.1007/s00373-012-1272-x

DO - 10.1007/s00373-012-1272-x

M3 - Article

AN - SCOPUS:84894346886

VL - 30

SP - 365

EP - 375

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 2

ER -