On the b-coloring of cographs and \(P_{4}\)-sparse graphs
type: Item
instance of: scholarly article
title: On the b-coloring of cographs and \(P_{4}\)-sparse graphs
zbMATH Open document ID: 1221.05128
author: Guillermo Durán
author: Frédéric Maffray
author: Javier Marenco
author: Mario Valencia-Pabon
author: Flavia Bonomo
published in: Graphs and Combinatorics
publication date: 2009-12-09T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5644633
zbMATH Keywords: b-coloring
zbMATH Keywords: b-continuity
zbMATH Keywords: b-monotonicity
zbMATH Keywords: cographs
zbMATH Keywords: \(P _{4}\)-sparse graphs
MaRDI profile type: Publication
full work available at URL: s00373-008-0829-1
OpenAlex ID: W2051593055
cites work: Achromatic number is NP-complete for cographs and interval graphs
cites work: Complement reducible graphs
cites work: Q3676177
cites work: On approximating the b-chromatic number
cites work: Q4483922
cites work: On the \(b\)-dominating coloring of graphs
cites work: On minimally \(b\)-imperfect graphs
cites work: The b-chromatic number of a graph
cites work: Recognizing $P_4 $-Sparse Graphs in Linear Time
cites work: A tree representation for \(P_ 4\)-sparse graphs
cites work: Linear time optimization algorithms for \(P_ 4\)-sparse graphs
cites work: Q4284253
cites work: Bounds for the b-chromatic number of some families of graphs
cites work: Q4414507
cites work: On b-perfect chordal graphs
DOI: 10.1007/S00373-008-0829-1
description: scientific article; zbMATH DE number 5644633