- Tytuł:
- On b-vertex and b-edge critical graphs
- Autorzy:
-
Eschouf, N. I.
Blidia, M. - Powiązania:
- https://bibliotekanauki.pl/articles/952798.pdf
- Data publikacji:
- 2015
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
b-coloring
b-chromatic number
critical graphs - Opis:
- A b-coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b-chromatic number b(G) of a graph G is the largest integer k such that G admits a b-coloring with k colors. A simple graph G is called b+-vertex (edge) critical if the removal of any vertex (edge) of G increases its b-chromatic number. In this note, we explain some properties in b+-vertex (edge) critical graphs, and we conclude with two open problems.
- Źródło:
-
Opuscula Mathematica; 2015, 35, 2; 171-180
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł