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 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.
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