Bounds for the b-chromatic number of some families of graphs

2005/06/09 by Mekkia Kouider, Kouider, Mekkia, Manouchehr Zaker +1 · 1 citation
Computer Science · Mathematics · #05C15 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #math.CO #msc:05C15

paper · pdf · doi:10.48550/arxiv.math/0506167

10 pages

arxiv created 2005/06/09 · openalex publication_date 2005/06/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In this paper we obtain some upper bounds for b-chromatic number of K_1,t -free graphs, graphs with given minimum clique partition and bipartite graphs. These bounds are in terms of either clique number or chromatic number of graphs or biclique number for bipartite graphs. We show that all the bounds are tight.

Cited by

• Finding b-colorings Using Feedback Edges

Related

• The b-Chromatic Number of Certain Graphs and Digraphs
• New bounds for the b-chromatic number of vertex deleted graphs
• On the Tight Chromatic Bounds for a Class of Graphs without Three Induced Subgraphs
• On The b-Chromatic Number of Regular Bounded Graphs
• Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree