On the choice number of claw-free perfect graphs

DOI10.1016/S0012-365X(03)00292-9zbMath1031.05055DBLPjournals/dm/GravierM04OpenAlexW2004137491WikidataQ56444938 ScholiaQ56444938MaRDI QIDQ1422425

Frédéric Maffray, Sylvain Gravier

Publication date: 14 February 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00292-9

zbMATH Keywords

Graph coloringList coloringClaw-free graphs

Mathematics Subject Classification ID

Perfect graphs (05C17)

Related Items (3)

Minimal paths and cycles in set systems ⋮ On the choosability of claw-free perfect graphs ⋮ List-coloring claw-free graphs with small clique number

Cites Work

• Unnamed Item
• Recognizing claw-free perfect graphs
• A description of claw-free perfect graphs
• Choice number of 3-colorable elementary graphs
• The NP-Completeness of Edge-Coloring
• Some upper bounds on the total and list chromatic numbers of multigraphs

This page was built for publication: On the choice number of claw-free perfect graphs