On approximating the b-chromatic number

Discrete Applied Mathematics

Volumn 146, Issue 1, 2005, Pages 106-110

  Corteel, Sylvie ^a   Valencia Pabon, Mario ^b   Vera, Juan Carlos ^c  

^a UNIVERSITY OF VERSAILLES   (France)

^b UNIVERSIDAD DE LOS ANDES   (Colombia)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Approximation algorithms; Combinatorial problems; Graph coloring

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

APPROXIMATION ALGORITHMS; B-CHROMATIC NUMBER; COMBINATORIAL PROBLEMS; GRAPH COLORING;

APPROXIMATION THEORY;

EID: 12444326187     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2004.09.006     Document Type: Article

References (6)

1. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 W.H. Freeman and Co San Francisco
2. J. Håstad Some optimal inapproximability results J. ACM 48 4 2001 798 859
3. R.W. Irving, and D.F. Manlove The b-chromatic number of a graph Discrete Appl. Math. 91 1999 127 141
4. D.S. Johnson Approximation algorithms for combinatorial problems J. Comput. System Sci. 9 1974 256 278
5. M. Kouider, and M. Mahéo Some bounds for the b-chromatic number of a graphs Discrete Math. 256 2002 267 277
6. J. Kratochvil, Z. Tuza, M. Voigt, On the b-chromatic number of a graph, Proceedings of WG'2002, Lecuture notes in Computer Science vol. 2573, 2002, pp. 310-320.