The r-dynamic edge coloring of a closed helm graph
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 clos...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2023 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/155565 |
| Acceso en línea: | https://hdl.handle.net/11441/155565 https://doi.org/10.33044/revuma.2669 |
| Access Level: | acceso abierto |
| Palabra clave: | r-dynamic coloring Closed helm graph Line graph |
| Sumario: | 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. |
|---|