On the choice number of claw-free perfect graphs

DOI10.1016/S0012-365X(03)00292-9zbMATH Open1031.05055DBLPjournals/dm/GravierM04OpenAlexW2004137491WikidataQ56444938 ScholiaQ56444938MaRDI QIDQ1422425FDOQ1422425

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

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

zbMATH Keywords

Graph coloringList coloringClaw-free graphs

Mathematics Subject Classification ID

Perfect graphs (05C17)

Cites Work

• The NP-Completeness of Edge-Coloring
• Some upper bounds on the total and list chromatic numbers of multigraphs
• Title not available (Why is that?)
• Choice number of 3-colorable elementary graphs
• A description of claw-free perfect graphs
• Recognizing claw-free perfect graphs

Cited In (5)

• Minimal paths and cycles in set systems
• On claw-free \(t\)-perfect graphs
• On the choosability of claw-free perfect graphs
• List-coloring claw-free graphs with small clique number
• Title not available (Why is that?)

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)