|
|||||
|
|
A characterization of be-critical trees |
|
| Authors: | Amel Bendali-Braham Noureddine Ikhlef-Eschouf Mostafa Blidia |
| Affiliation: | 1. Laboratory of Mechanics, Physics and Mathematical Modeling, Faculty of Sciences, University of Médéa, Algeria;2. Department of Mathematics and Computer Science, Faculty of Sciences, University of Médéa, Algeria;3. Laboratory LAMDA-RO, Department of Mathematics, University of Blida 1, B.P. 270, Blida, Algeria |
| Abstract: | The b-chromatic number of a graph G is the largest integer k such that G admits a proper coloring with k colors for which each color class contains a vertex that has at least one neighbor in all the other color classes. A graph G is called -critical if the contraction of any edge e of G decreases the b-chromatic number of G. The purpose of this paper is the characterization of all -critical trees. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |