On the b-chromatic number of graphs

Jan Kratochvíl, Zsolt Tuza, Margit Voigt

Research output: Chapter in Book/Report/Conference proceedingConference contribution

85 Citations (Scopus)

Abstract

The b-chromatic number b(G) of a graph G = (V,E) is the largest integer κ such that G admits a vertex partition into κ independent sets Xi (i = 1,. ., κ) such that each Xi contains a vertex xi adjacent to at least one vertex of each Xj, j ≠ i. We discuss on the tightness of some bounds on b(G) and on the complexity of determining b(G). We also determine the asymptotic behavior of b(G n,p) for the random graph, within the accuracy of a multiplicative factor 2 + o(1) as n→∞.

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 28th International Workshop, WG 2002, Revised Papers
PublisherSpringer Verlag
Pages310-320
Number of pages11
ISBN (Print)3540003312, 9783540003311
Publication statusPublished - Jan 1 2002
Event28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002 - Cesky Krumlov, Czech Republic
Duration: Jun 13 2002Jun 15 2002

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2573 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002
CountryCzech Republic
CityCesky Krumlov
Period6/13/026/15/02

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'On the b-chromatic number of graphs'. Together they form a unique fingerprint.

  • Cite this

    Kratochvíl, J., Tuza, Z., & Voigt, M. (2002). On the b-chromatic number of graphs. In Graph-Theoretic Concepts in Computer Science - 28th International Workshop, WG 2002, Revised Papers (pp. 310-320). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2573 LNCS). Springer Verlag.