On approximating the b-chromatic number

Authors:
Sylvie Corteel;Mario Valencia-Pabon;Juan-Carlos Vera
Affiliations:
CNRS, PRiSM, Université de Versailles, 45 Av. des Etats Unis. 78035 Versailles, France;Departamento de Matemáticas, Universidad de los Andes, Cra, 1 No. 18A - 70, Bogotá, Colombia;Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 4
Cited 5

The b-chromatic number of a graph

Discrete Applied Mathematics
Some optimal inapproximability results

Journal of the ACM (JACM)
Some bounds for the b-chromatic number of a graph

Discrete 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 b-colorings in regular graphs

Discrete Applied Mathematics
Note: On the b-chromatic number of Kneser graphs

Discrete Applied Mathematics
On the b-coloring of P4-tidy graphs

Discrete Applied Mathematics
b-coloring of Kneser graphs

Discrete Applied Mathematics
Note: A note on approximating the b-chromatic number

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

We consider the problem of approximating the b-chromatic number of a graph. We show that there is no constant ε 0 for which this problem can be approximated within a factor of 120/133-ε in polynomial time, unless P = NP. This is the first hardness result for approximating the b-chromatic number.