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)][χ(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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.