r-Dynamic chromatic number of some line graphs
From MaRDI portal
Publication:2322985
DOI10.1007/S13226-018-0288-1zbMATH Open1419.05073OpenAlexW2902594795WikidataQ128870241 ScholiaQ128870241MaRDI QIDQ2322985FDOQ2322985
N. Mohanapriya, Hanna Furmańczyk, Vivin J. Vernold
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Complexity of conditional colorability of graphs
- Title not available (Why is that?)
- On the list dynamic coloring of graphs
- On \(r\)-dynamic coloring of graphs
- Title not available (Why is that?)
- Dynamic chromatic number of regular graphs
- On \(r\)-dynamic chromatic number of graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- 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
Cited In (8)
- \(r\)-dynamic chromatic number of subdivision-edge neighborhood corona of certain graph families
- The $r$-dynamic edge coloring of a closed helm graph
- On \(r\)-hued coloring of corona product of some graphs
- Channel assignment with \(r\)-dynamic coloring
- On r-dynamic vertex coloring of some flower graph families
- Title not available (Why is that?)
- On r-dynamic chromatic number of some brick product graphs C(2n, 1, p)
- On the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graph
This page was built for publication: \(r\)-Dynamic chromatic number of some line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2322985)