A characterization of claw-free b-perfect graphs

DOI10.1016/J.DISC.2011.09.029MaRDI QIDQ658056zbMATH OpenOpenAlexFDO

Authors T. Karthick, Frédéric Maffray

Publication date 11 January 2012

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2011.09.029

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

Cites work

• A Linear Recognition Algorithm for Cographs
• A description of claw-free perfect graphs
• Claw-free graphs---a survey
• Claw-free graphs. V. Global structure
• Difference graphs
• Graph Classes: A Survey
• On a property of the class of n-colorable graphs
• On b-perfect chordal graphs
• On minimally \(b\)-imperfect graphs
• On the \(b\)-dominating coloring of graphs
• Some bounds for the \(b\)-chromatic number of a graph
• The b-chromatic number of a graph
• The structure of claw-free graphs
• Threshold graphs and related topics

Cited in

(8)

• Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
• A characterization of one class of graphs without 3-claws
• Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
• The \(b\)-chromatic number and related topics -- a survey
• On claw-free \(t\)-perfect graphs
• Strongly perfect claw‐free graphs—A short proof
• On the choice number of claw-free perfect graphs
• A characterization of edge \(b\)-critical graphs

This page was built for publication: A characterization of claw-free \(b\)-perfect graphs

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