Solving the dynamic coloring problem for direct products of paths with fan graphs
This paper deals with the r-dynamic chromatic problem of the direct product of a path with a fan graph Fm,n. The problem is completely solved except for the case n < r ∈ {2m + 2, 2m + 3}, which is solved under certain assumptions. It enables us to determine in particular the dynamic chromatic num...
| 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/155652 |
| Acceso en línea: | https://hdl.handle.net/11441/155652 https://doi.org/10.2478/auom-2023-0006 |
| Access Level: | acceso abierto |
| Palabra clave: | Dynamic coloring problem Direct product Path Fan graph |
| Sumario: | This paper deals with the r-dynamic chromatic problem of the direct product of a path with a fan graph Fm,n. The problem is completely solved except for the case n < r ∈ {2m + 2, 2m + 3}, which is solved under certain assumptions. It enables us to determine in particular the dynamic chromatic number concerning this problem, for all r ≤ 7, and also, for all m ∈ {1, 2}. |
|---|