Opuscula Mathematica
Opuscula Math. 33, no. 1 (), 19-28
Opuscula Mathematica

On vertex b-critical trees

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.
Mathematics Subject Classification: 05C15.
Cite this article as:
Mostafa Blidia, Noureddine Ikhlef Eschouf, Frédéric Maffray, On vertex b-critical trees, Opuscula Math. 33, no. 1 (2013), 19-28, http://dx.doi.org/10.7494/OpMath.2013.33.1.19
Download this article's citation as:
a .bib file (BibTeX), a .ris file (RefMan), a .enw file (EndNote)
or export to RefWorks.

RSS Feed

horizontal rule

ISSN 1232−9274, e-ISSN 2300−6919, DOI https://doi.org/10.7494/OpMath
Copyright © 2003−2017 OPUSCULA MATHEMATICA
Contact: opuscula@agh.edu.pl
Made by Tomasz Zabawa

horizontal rule

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.