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 number c...
Main Authors: | Falcón Raúl M., Gowri S., Venkatachalam M. |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2023-01-01
|
Series: | Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica |
Subjects: | |
Online Access: | https://doi.org/10.2478/auom-2023-0006 |
Similar Items
-
On the r-dynamic coloring of some fan graph families
by: Falcón Raúl M., et al.
Published: (2021-11-01) -
On the r-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph
by: T. Deepa, et al.
Published: (2021-12-01) -
Colorings of Plane Graphs Without Long Monochromatic Facial Paths
by: Czap Július, et al.
Published: (2021-08-01) -
On the r-dynamic coloring of subdivision-edge coronas of a path
by: G. Nandini, et al.
Published: (2020-06-01) -
Total colorings of some classes of four regular circulant graphs
by: R. Navaneeth, et al.
Published: (2024-01-01)