Improved bounds on the b-chromatic number using the independence and chromatic numbers
math.CO
Submitted: 2026-06-05
Updated: 2026-10-25
Comments: 15 pages, 3 figures
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Finding a minimum proper vertex coloring is-hard and hard to approximate.
Terminology
Abstract
Finding a minimum proper vertex coloring is-hard and hard to approximate. B-coloring is used as a heuristic approach to graph coloring. A b-coloring of a graph G is a proper vertex coloring where each color class contains at least one vertex (a b-vertex) adjacent to a vertex in every other color class. The maximum number of colors in such a coloring is the b-chromatic number, b (G). A b-coloring is a variation in which a b-vertex is adjacent to a b-vertex in every other color class. We employ the b-coloring to prove that any n-vertex graph G with independence number at most t satisfies b (G) at most [(t-1)n+tχ(G)]/(2t-1). This bound extends the bounds of Kouider and Zaker (2006) and Alkhateeb and Kohl (2011) and significantly improves the bound in terms of the clique partition number. We show that this bound is sharp for all t at least 2 and χ(G) at least 3. Furthermore, we provide a refined bound based on the maximum number of vertex-disjoint independent sets of size t. Finally, we prove b (G) at most [(t-2)n+(t-1)χ(G)]/(2t-3) for all K 1,t-free graphs G, a significant improvement over the analogous bound for b (G).
Sources
Related papers
- Three-ends Furstenberg estimates and approximate rectangles
- Multicolor Ramsey numbers of ordered matchings
- Exponential random graph models with soft clique constraints
- A Full-Sequence Quantitative Gap Between the Chromatic and Cochromatic Numbers of a Random Graph
- Ehrhart positivity for paving positroids
- Nonlinear lower-tail large deviations at criticality