2011

2014

Learn More

A b-coloring of a graph G by k colors is a proper vertex coloring such that every color class contains a color-dominating vertex, that is, a vertex having neighbors in all other k−1 color classes. The b-chromatic number χ b (G) is the maximum integer k for which G has a b-coloring by k colors. Moreover, the graph G is called b-continuous if G admits a… (More)

- ‹
- 1
- ›