The b-continuity of graphs with large girth
Ana Silva, Cl\'audia Linhares-Sales

TL;DR
This paper proves that graphs with girth at least 10 are b-continuous, meaning they can be properly b-colored with any number of colors between their chromatic number and b-chromatic number.
Contribution
The paper establishes a new sufficient condition (girth at least 10) for graphs to be b-continuous, extending understanding of b-coloring properties.
Findings
Graphs with girth ≥ 10 are b-continuous.
Not all graphs are b-continuous, but high girth ensures this property.
The result broadens the class of graphs known to be b-continuous.
Abstract
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a vertex which is adjacent to each other color class. The b-chromatic number of is the maximum integer for which has a b-coloring with colors. A graph is b-continuous if has a b-coloring with colors, for every integer in the interval . It is known that not all graphs are b-continuous. In this article, we show that if has girth at least 10, then is b-continuous.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Advanced Graph Theory Research · Limits and Structures in Graph Theory
