On the choice number of claw-free perfect graphs

DOI10.1016/S0012-365X(03)00292-9MaRDI QIDQ1422425zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Sylvain Gravier, Frédéric Maffray

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)

Recommendations

• On the choosability of claw-free perfect graphs
• The structure of claw-free perfect graphs
• On claw-free t-perfect graphs
• A description of claw-free perfect graphs
• Clique-chromatic numbers of claw-free graphs
• A characterization of claw-free \(b\)-perfect graphs
• Clique-perfectness of claw-free planar graphs
• Characterising claw-free \(t\)-perfect graphs
• Strongly perfect claw‐free graphs—A short proof
• On the Erdős-Gyárfás conjecture in claw-free graphs

Cites work

• scientific article; zbMATH DE number 1123764 (Why is no real title available?)
• A description of claw-free perfect graphs
• Choice number of 3-colorable elementary graphs
• Recognizing claw-free perfect graphs
• Some upper bounds on the total and list chromatic numbers of multigraphs
• The NP-Completeness of Edge-Coloring

Cited in

(5)

• scientific article; zbMATH DE number 1952889 (Why is no real title available?)
• Minimal paths and cycles in set systems
• List-coloring claw-free graphs with small clique number
• On claw-free \(t\)-perfect graphs
• On the choosability of claw-free perfect graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422425)