Artículo
The r-dynamic edge coloring of a closed helm graph
Autor/es | Falcón Ganfornina, Raúl Manuel
Venkatachalam, Mathiyazhagan Gowri, Sathasivam Nandini, Gnanasekaran |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2023-11-22 |
Fecha de depósito | 2024-02-26 |
Publicado en |
|
Resumen | 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 . ... 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 . In this paper, we obtain the r-dynamic edge chromatic number of any given closed helm graph for any positive integer r. This coincides with the r-dynamic chromatic number of the line graph of a closed helm graph. |
Agencias financiadoras | Junta de Andalucía |
Identificador del proyecto | FQM-016 |
Cita | Falcón Ganfornina, R.M., Venkatachalam, M., Gowri, S. y Nandini, G. (2023). The r-dynamic edge coloring of a closed helm graph. Revista de la Unión Matemática Argentina, 65 (2), 331-346. https://doi.org/10.33044/revuma.2669. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
The r-dynamic edge coloring of ... | 410.4Kb | [PDF] | Ver/ | |