@Article{Blidia2013,
author = "Blidia, Mostafa and Eschouf, Noureddine Ikhlef and Maffray, Frédéric",
title = "On vertex b-critical trees",
journal = "Opuscula Math.",
year = "2013",
volume = "33",
number = "1",
pages = "19--28",
doi = "http://dx.doi.org/10.7494/OpMath.2013.33.1.19",
url = "http://dx.doi.org/10.7494/OpMath.2013.33.1.19",
abstract = "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\) decreases the b-chromatic number. We prove various properties of b-critical trees. In particular, we characterize b-critical trees.",
keywords = "b-coloring, b-critical graphs, b-critical trees",
issn = "1232-9274"
}