Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
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.
Słowa kluczowe
Czasopismo
Rocznik
Tom
Strony
19--28
Opis fizyczny
Bibliogr. 4 poz.
Twórcy
autor
autor
autor
- University of Blida LAMDA-RO, Department of Mathematics, B.P. 270, Blida, Algeria, m_blidia@yahoo.fr
Bibliografia
- [1] C. Berge, Graphs, North Holland, 1985.
- [2] N. Ikhlef Eschouf, Characterization of some b-chromatic edge critical graphs, Australas. J. Combin. 47 (2010), 21-35.
- [3] R.W. Irving, D.F. Manlove, The b-chromatic number of graphs, Discrete Appl. Math. 91 (1999), 127-141.
- [4] D.F. Manlove, Minimaximal and maximinimal optimization problems: a partial order-based approach, PhD thesis, Computing Science Department, Glasgow University, 1998.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-article-AGHT-0009-0007