154
click to vote
DAM
2011
14 years 5 months ago
2011
A b-coloring of a graph is a coloring such that every color class admits a vertex adjacent to at least one vertex receiving each of the colors not assigned to it. The b-chromatic ...
91
Voted
GC
2010
Springer
14 years 8 months ago
2010
Springer
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex adjacent to some vertex...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number of a ...