\(r\)-Dynamic chromatic number of some line graphs
From MaRDI portal
Publication:2322985
DOI10.1007/s13226-018-0288-1zbMath1419.05073OpenAlexW2902594795WikidataQ128870241 ScholiaQ128870241MaRDI QIDQ2322985
N. Mohanapriya, Hanna Furmańczyk, J. Vernold Vivin
Publication date: 30 August 2019
Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13226-018-0288-1
Related Items (5)
On r-dynamic vertex coloring of some flower graph families ⋮ On r-dynamic chromatic number of some brick product graphs C(2n, 1, p) ⋮ The $r$-dynamic edge coloring of a closed helm graph ⋮ Unnamed Item ⋮ On the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graph
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(r\)-dynamic coloring of graphs
- On the difference between chromatic number and dynamic chromatic number of graphs
- Dynamic chromatic number of regular graphs
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
- On \(r\)-dynamic chromatic number of graphs
- The 2nd-order conditional 3-coloring of claw-free graphs
- On the list dynamic coloring of graphs
- Complexity of conditional colorability of graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
This page was built for publication: \(r\)-Dynamic chromatic number of some line graphs