Buscar
Mostrando ítems 1-1 de 1
Artículo
The r-dynamic edge coloring of a closed helm graph
(Unión Matemática Argentina, 2023-11-22)
As a natural generalization of the classical coloring problem in graph theory, the dynamic coloring problem deals with the existence of a proper coloring c of a graph so that |c(N(v))| ≥ min{r, d (v)} for every vertex v . ...