Notes: 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 15213, USA
Venue:
Discrete Applied Mathematics
Year:
2005

Citing 5
Cited 6

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
Approximation algorithms for combinatorial problems

Journal of Computer and System Sciences

Distance-2 Self-stabilizing Algorithm for a b-Coloring of Graphs

SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Recolouring-resistant colourings

Discrete Applied Mathematics
A distributed algorithm for a b-coloring of a graph

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
On the b-chromatic number of regular graphs without 4-cycle

Discrete Applied Mathematics
A new pyramidal approach for the address block location based on hierarchical graph coloring

ICIAR'07 Proceedings of the 4th international conference on Image Analysis and Recognition
Bounds for the b-chromatic number of G-v

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

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.