Note: A note on approximating the b-chromatic number

Authors:
FrantišEk GalčíK;JáN Katrenič
Affiliations:
-;-
Venue:
Discrete Applied Mathematics
Year:
2013

Citing 7
Cited 0

The b-chromatic number of a graph

Discrete Applied Mathematics
On the b-Chromatic Number of Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
On approximating the b-chromatic number

Discrete Applied Mathematics
On b-colorings in regular graphs

Discrete Applied Mathematics
On the b-Coloring of Cographs and P 4-Sparse Graphs

Graphs and Combinatorics
Note: On the b-chromatic number of Kneser graphs

Discrete Applied Mathematics
The b-Chromatic Number of Cubic Graphs

Graphs and Combinatorics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We consider the problem of approximating the b-chromatic number of a graph. In 2005, Corteel et al. proved that there is no constant @e0 for which this problem can be approximated within a factor of 120/113-@e in polynomial time, unless P=NP. An existence of a constant-factor approximation algorithm for the b-chromatic number in general graphs was formulated as an open problem. In this paper we settle this question in a negative way proving that there is no constant @e0, for which the problem can be approximated within a factor n^1^/^4^-^@e, unless P=NP.