On vertex b-critical trees
A b-coloring is a proper coloring of the vertices of a graph such that each color class has a vertex that has neighbors of all other colors. The b-chromatic number of a graph G is the largest k such that G admits a b-coloring with k colors. A graph G is b-critical if the removal of any vertex of G d...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
AGH Univeristy of Science and Technology Press
2013-01-01
|
| Series: | Opuscula Mathematica |
| Subjects: | |
| Online Access: | http://www.opuscula.agh.edu.pl/vol33/1/art/opuscula_math_3302.pdf |