A characterization of claw-free \(b\)-perfect graphs
type: Item
instance of: scholarly article
title: A characterization of claw-free \(b\)-perfect graphs
zbMATH Open document ID: 1232.05082
author: T. Karthick
author: Frédéric Maffray
published in: Discrete Mathematics
publication date: 2012-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C17
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 5996500
MaRDI profile type: Publication
full work available at URL: j.disc.2011.09.029
OpenAlex ID: W2077781029
cites work: Graph Classes: A Survey
cites work: Q3416248
cites work: Claw-free graphs. V. Global structure
cites work: A Linear Recognition Algorithm for Cographs
cites work: Claw-free graphs---a survey
cites work: Difference graphs
cites work: On the \(b\)-dominating coloring of graphs
cites work: On minimally \(b\)-imperfect graphs
cites work: On b-perfect chordal graphs
cites work: The b-chromatic number of a graph
cites work: Some bounds for the \(b\)-chromatic number of a graph
cites work: A description of claw-free perfect graphs
cites work: Threshold graphs and related topics
cites work: On a property of the class of n-colorable graphs
DOI: 10.1016/J.DISC.2011.09.029
description: scientific article; zbMATH DE number 5996500