On dynamic coloring of certain cycle-related graphs
From MaRDI portal
Publication:2302720
DOI10.1007/S40065-018-0219-3zbMATH Open1433.05130OpenAlexW2888477400WikidataQ129399259 ScholiaQ129399259MaRDI QIDQ2302720FDOQ2302720
Authors: Vivin J. Vernold, N. Mohanapriya, Johan Kok, Venkatachalam
Publication date: 26 February 2020
Published in: Arabian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40065-018-0219-3
Recommendations
Cites Work
- Sur le coloriage des graphs
- Title not available (Why is that?)
- Complexity of conditional colorability of graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Title not available (Why is that?)
- On the list dynamic coloring of graphs
- Title not available (Why is that?)
- Dynamic chromatic number of regular graphs
- On \(r\)-dynamic chromatic number of graphs
- The 2nd-order conditional 3-coloring of claw-free graphs
- On the difference between chromatic number and dynamic chromatic number of graphs
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
- Harmonious colouring of cycles, regular graphs, star \(n\)-leaf, festoon trees and bigraphs
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
- \(\delta\)-dynamic chromatic number of helm graph families
Cited In (19)
- The $r$-dynamic edge coloring of a closed helm graph
- Element deletion changes in dynamic coloring of graphs
- Title not available (Why is that?)
- On \(r\)-hued coloring of corona product of some graphs
- On the dynamic coloring of graphs
- On the \(r\)-dynamic coloring of the direct product of a path and a \(k\)-subdivision of a star graph
- On the \(r\)-dynamic coloring of the direct product of a path with either a complete graph or a wheel graph
- On the \(r\)-dynamic coloring of the direct product of a path with either a path or a cycle
- Title not available (Why is that?)
- Dynamic chromatic number of unicyclic graphs and bicyclic graphs
- Computing graph invariants on rotagraphs using dynamic algorithm approach: The case of (2, 1)-colorings and independence numbers
- Optimal secret share distribution in degree splitting communication networks
- On \(r\)-dynamic coloring on Mycielskian graphs
- On r− dynamic coloring of the gear graph families
- Dynamic coloring on restricted graph classes
- On r- dynamic coloring of the family of bistar graphs
- Graph \(r\)-hued colorings -- a survey
- On \(r\)-dynamic coloring of \(n\)-sunlet graph families
- On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)
This page was built for publication: On dynamic coloring of certain cycle-related graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302720)