A new approach to b-coloring of regular graphs
Preprint
Abstract
Let $G$ be a graph and c a proper k-coloring of G, i.e. any two adjacent vertices u and v have different colors c(u) and c(v). A proper k-coloring is a b-coloring if there exists a vertex in every color class that contains all the colors in its closed neighborhood. The maximum number of colors k admitting b-coloring of G is the b-chromatic number. We present two separate approaches to the conjecture posed by Blidia et. al that the b-chromatic number equals to d+1 for every d-regular graph of girth at least five except the Petersen graph.
Keywords
All Related Versions
This publication has 6 references indexed in Scilit:
- On b-acyclic chromatic number of a graphComputational and Applied Mathematics, 2022
- b-continuity and partial Grundy coloring of graphs with large girthDiscrete Mathematics, 2020
- The b-chromatic number and related topics—A surveyDiscrete Applied Mathematics, 2018
- On the b-chromatic number of regular bounded graphsDiscrete Applied Mathematics, 2015
- The b-chromatic number and f-chromatic vertex number of regular graphsDiscrete Applied Mathematics, 2014
- On the b-chromatic number of regular graphsDiscrete Applied Mathematics, 2011