Graph r-hued colorings—A survey
Abstract A (k, r)-coloring of a graph G is a proper k-vertex coloring of G such that the
neighbors of each vertex of degree d will receive at least min {d, r} different colors. The r …
neighbors of each vertex of degree d will receive at least min {d, r} different colors. The r …
[HTML][HTML] On r-dynamic coloring of graphs
An r-dynamic proper k-coloring of a graph G is a proper k-coloring of G such that every
vertex in V (G) has neighbors in at least min {d (v), r} different color classes. The r-dynamic …
vertex in V (G) has neighbors in at least min {d (v), r} different color classes. The r-dynamic …
Dynamic coloring parameters for graphs with given genus
S Loeb, T Mahoney, B Reiniger, J Wise - Discrete Applied Mathematics, 2018 - Elsevier
A proper vertex coloring of a graph G is r-dynamic if for each v∈ V (G), at least min {r, d (v)}
colors appear in NG (v). In this paper we investigate r-dynamic versions of coloring, list …
colors appear in NG (v). In this paper we investigate r-dynamic versions of coloring, list …
-Dynamic coloring of the corona product of graphs
Let G=(V, E) be a graph. A proper k-coloring of graph G is r-dynamic coloring if for every v,
the neighbors of vertex v receive at least min {r, d (v)} different colors. The minimum k such …
the neighbors of vertex v receive at least min {r, d (v)} different colors. The minimum k such …
On r-dynamic chromatic number of the corronation of path and several graphs
This study is a natural extension of k-proper coloring of any simple and connected graph G.
By an rdynamic coloring of a graph G, we mean a proper k coloring of graph G such that the …
By an rdynamic coloring of a graph G, we mean a proper k coloring of graph G such that the …
[PDF][PDF] On the r-dynamic coloring of the direct product of a path with either a path or a cycle
On the $r$-dynamic coloring of the direct product of a path with either a path or a cycle Page 1
http://www.aimspress.com/journal/Math AIMS Mathematics, 5(6): 6496–6520. DOI:10.3934/math.2020419 …
http://www.aimspress.com/journal/Math AIMS Mathematics, 5(6): 6496–6520. DOI:10.3934/math.2020419 …
Several classes of graphs and their r-dynamic chromatic numbers
Let G be a simple, connected and undirected graph. Let r; k be natural numbers. By a proper
k-coloring of a graph G, we mean a map c: V (G)! S, where jSj= k, such that any two adjacent …
k-coloring of a graph G, we mean a map c: V (G)! S, where jSj= k, such that any two adjacent …
On the -dynamic coloring of the direct product of a path and a -subdivision of a star graph
On the -dynamic coloring of the direct product of a path and a -subdivision of a star graph
Page 1 Discrete Mathematics, Algorithms and Applications Vol. 14, No. 3 (2022) 2150121 (19 …
Page 1 Discrete Mathematics, Algorithms and Applications Vol. 14, No. 3 (2022) 2150121 (19 …
[HTML][HTML] List 3-dynamic coloring of graphs with small maximum average degree
SJ Kim, B Park - Discrete Mathematics, 2018 - Elsevier
An r-dynamic k-coloring of a graph G is a proper k-coloring such that for any vertex v, there
are at least min {r, deg G (v)} distinct colors in NG (v). The r-dynamic chromatic number χ rd …
are at least min {r, deg G (v)} distinct colors in NG (v). The r-dynamic chromatic number χ rd …
Several classes of graphs and their r-dynamic chromatic numbers
Let G be a simple, connected and undirected graph. Let r, k be natural numbers. By a proper
k-coloring of a graph G, we mean a map c: V (G)→ S, where| S|= k, such that any two …
k-coloring of a graph G, we mean a map c: V (G)→ S, where| S|= k, such that any two …