English

The b-continuity of graphs with large girth

Combinatorics 2016-06-16 v2 Discrete Mathematics

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 GG is the maximum integer b(G)b(G) for which GG has a b-coloring with b(G)b(G) colors. A graph GG is b-continuous if GG has a b-coloring with kk colors, for every integer kk in the interval [χ(G),b(G)][\chi(G),b(G)]. It is known that not all graphs are b-continuous. In this article, we show that if GG has girth at least 10, then GG is b-continuous.

Keywords

Cite

@article{arxiv.1602.01298,
  title  = {The b-continuity of graphs with large girth},
  author = {Ana Silva and Cláudia Linhares-Sales},
  journal= {arXiv preprint arXiv:1602.01298},
  year   = {2016}
}

Comments

10 pages

R2 v1 2026-06-22T12:42:47.687Z