Search
Now showing items 1-2 of 2
Several classes of graphs and their r-dynamic chromatic numbers
(2018-02-28)
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 vertices receive di erent colors. ...
On r-dynamic coloring of some graph operations
(2018-03-07)
Let G be a simple, connected and undirected graph. Given r; k as any natural numbers. By an
r-dynamic k-coloring of graph G, we mean a proper k-coloring c(v) of G such that jc(N(v))j
minfr; d(v)g for each vertex v in ...