On the b-chromatic number of graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2573 LNCS, Issue , 2002, Pages 310-320

  Kratochvíl, Jan ^a   Tuza, Zsolt ^b,c   Voigt, Margit ^d  

^a CHARLES UNIVERSITY   (Czech Republic)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^c UNIVERSITY OF PANNONIA   (Hungary)

^d ILMENAU UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC BEHAVIORS; B-CHROMATIC NUMBER; GRAPH G; INDEPENDENT SET; MULTIPLICATIVE FACTORS; RANDOM GRAPHS; VERTEX PARTITIONS;

GRAPH THEORY;

ARTIFICIAL INTELLIGENCE; COMPUTERS;

EID: 84901453119     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36379-3_27     Document Type: Conference Paper

References (11)

1. H.L. Bodlaender: Achromatic number is NP-complete for cographs and interval graphs, Inf. Process. Lett. 31 (1989) 135-138
2. F. Harary, S. Hedetniemi: The achromatic number of a graph, J. Combin. Th. 8 (1970) 154-161
3. P. Hell, D.J. Miller: Graphs with given achromatic number, Discrete Math. 16 (1976) 195-207
4. I. Holyer: The NP-completeness of edge-coloring, SIAM J. Comput. 10 (1981) 718-720
5. F. Hughes, G. MacGilliway: The achromatic number of graphs: A survey and some new results, Bull. Inst. Comb. Appl. 19 (1997) 27-56
6. R. W. Irving, D. F. Manlove, The b-chromatic number of a graph, Discrete Applied Math., 91 (1999), 127-141.
7. M. Kouider, M. Mahéo, The b-chromatic number of a graph, manuscript, 2000.
8. C. McDiarmid: Achromatic numbers of random graphs, Math. Proc. Camb. Philos. Soc. 92 (1982) 21-28
9. J. Kratochvíl, Zs. Tuza, M. Voigt: New trends in the theory of graph colorings: Choosability and list coloring, In: Contemporary Trends in Discrete Mathematics (from DIMACS and DIMATIA to the future) (eds. R.L.Graham, J.Kratochvíl, J.Nešetřil, F.S.Roberts), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Volume 49, American Mathematical Society, Providence, RI, 1999, pp. 183-197
10. D. Manlove: Minimaximal and maximinimal optimization problems: a partial order-based approach, PhD. thesis, University of Glasgow, Dept. of Computing Science, June 1998
11. C. Thomassen: 3-list-coloring planar graphs of girth 5, J. Combin. Theory Ser B 64 (1995) 101-107