2000 character limit reached
The b-continuity of graphs with large girth
Published 3 Feb 2016 in math.CO and cs.DM | (1602.01298v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper.