A characterization of claw-free \(b\)-perfect graphs

DOI10.1016/j.disc.2011.09.029zbMath1232.05082OpenAlexW2077781029MaRDI QIDQ658056

Frédéric Maffray, T. Karthick

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)

Related Items (2)

The \(b\)-chromatic number and related topics -- a survey ⋮ A characterization of edge \(b\)-critical graphs

Cites Work

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

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