Abstract
A b-coloring of a graph is a proper coloring of its vertices such that every color class contains a vertex that has neighbors in all other color classes. The b-chromatic number of a graph is the largest integer b(G) such that the graph has a b-coloring with b(G) colors. This metric is upper bounded by the largest integer m(G) for which G has at least m(G) vertices with degree at least m(G)−1. There are a number of results reporting that graphs with high girth have high b-chromatic number when compared to m(G). Here, we prove that every graph with girth at least 7 has b-chromatic number at least m(G)−1. Our proof also yields a polynomial algorithm that produces an optimal b-coloring of these graphs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
