On approximating the b-chromatic number
type: Item
instance of: scholarly article
title: On approximating the b-chromatic number
zbMATH Open document ID: 1057.05032
author: Sylvie Corteel
author: Mario Valencia-Pabon
author: Juan Vera
published in: Discrete Applied Mathematics
publication date: 2005-02-23T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 2137383
zbMATH Keywords: Combinatorial problems
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Graph coloring
Wikidata QID: Q58051183
MaRDI profile type: Publication
full work available at URL: j.dam.2004.09.006
OpenAlex ID: W2060043675
cites work: Q4198056
cites work: Some optimal inapproximability results
cites work: The b-chromatic number of a graph
cites work: Approximation algorithms for combinatorial problems
cites work: Some bounds for the \(b\)-chromatic number of a graph
cites work: Q4414507
DOI: 10.1016/J.DAM.2004.09.006
DBLP publication ID: journals/dam/CorteelVV05
description: scientific article; zbMATH DE number 2137383