[HTML][HTML] The b-chromatic number and related topics—a survey
M Jakovac, I Peterin - Discrete Applied Mathematics, 2018 - Elsevier
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-
coloring in which every color class contains at least one vertex that has a neighbor in each …
coloring in which every color class contains at least one vertex that has a neighbor in each …
Several Roman domination graph invariants on Kneser graphs
This paper considers the following three Roman domination graph invariants on Kneser
graphs: Roman domination, total Roman domination, and signed Roman domination. For …
graphs: Roman domination, total Roman domination, and signed Roman domination. For …
Some results on the b-chromatic number in complementary prism graphs
A Bendali-Braham, N Ikhlef-Eschouf… - RAIRO-Operations …, 2019 - rairo-ro.org
A b-coloring of a graph G is a proper coloring of G with k colors such that each color class
has a vertex that is adjacent to at least one vertex of every other color classes. The b …
has a vertex that is adjacent to at least one vertex of every other color classes. The b …
b-chromatic number of Cartesian product of some families of graphs
R Balakrishnan, SF Raj, T Kavaskar - Graphs and Combinatorics, 2014 - Springer
A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each
color class contains a color dominating vertex, that is, a vertex which has a neighbor in each …
color class contains a color dominating vertex, that is, a vertex which has a neighbor in each …
[PDF][PDF] The bq-coloring of graphs
B Effantin - Discrete Mathematics Letters, 2023 - dmlett.com
In this article, a new graph coloring, called the bq-coloring, is introduced. A bq-coloring of a
graph G is a proper vertex coloring of G with k colors such that every color class c admits a …
graph G is a proper vertex coloring of G with k colors such that every color class c admits a …
The b-continuity of graphs with large girth
A b-coloring of the vertices of a graph is a proper coloring where each color class contains a
vertex which is adjacent to each other color class. The b-chromatic number of G is the …
vertex which is adjacent to each other color class. The b-chromatic number of G is the …
[HTML][HTML] B-continuity and partial Grundy coloring of graphs with large girth
A Ibiapina, A Silva - Discrete Mathematics, 2020 - Elsevier
A b-coloring of a graph G is a proper coloring such that each color class has at least one
vertex which is adjacent to each other color class. The b-spectrum of G is the set S b (G) of …
vertex which is adjacent to each other color class. The b-spectrum of G is the set S b (G) of …
-coloring of Cartesian Product of Trees
R Balakrishnan, S Francis Raj, T Kavaskar - 2016 - projecteuclid.org
A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each
color class contains a color dominating vertex, that is, a vertex which has a neighbor in each …
color class contains a color dominating vertex, that is, a vertex which has a neighbor in each …
On two conjectures on b-coloring of graph products
SF Raj, T Kavaskar - Studia Scientiarum Mathematicarum …, 2017 - akjournals.com
A b-coloring of a graph G with k colors is a proper coloring of G using k colors in which each
color class contains a color dominating vertex, that is, a vertex which has a neighbor in each …
color class contains a color dominating vertex, that is, a vertex which has a neighbor in each …
[PDF][PDF] b-Coloring of the Mycielskian of Some Classes of Graphs
SF Raj, M Gokulnath - Discussiones Mathematicae Graph …, 2022 - bibliotekanauki.pl
The b-chromatic number b (G) of a graph G is the maximum k for which G has a proper
vertex coloring using k colors such that each color class contains at least one vertex …
vertex coloring using k colors such that each color class contains at least one vertex …