On \(r\)-dynamic chromatic number of graphs
From MaRDI portal
Publication:908316
DOI10.1016/j.dam.2015.07.019zbMath1330.05077arXiv1401.6470OpenAlexW1501863447MaRDI QIDQ908316
Publication date: 4 February 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6470
Related Items (22)
On \(r\)-dynamic coloring of graphs ⋮ On the \(r\)-dynamic coloring of subdivision-edge coronas of a path ⋮ On the \(r\)-dynamic coloring of the direct product of a path with either a path or a cycle ⋮ On r-dynamic vertex coloring of some flower graph families ⋮ On r-dynamic chromatic number of some brick product graphs C(2n, 1, p) ⋮ Graph \(r\)-hued colorings -- a survey ⋮ On \(r\)-hued colorings of graphs without short induced paths ⋮ Weak dynamic coloring of planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A counterexample to montgomery's conjecture on dynamic colourings of regular graphs ⋮ δ-Dynamic chromatic number of Helm graph families ⋮ On dynamic coloring of certain cycle-related graphs ⋮ Unnamed Item ⋮ \(r\)-Dynamic chromatic number of some line graphs ⋮ r-Dynamic coloring of the corona product of graphs ⋮ \(r\)-dynamic chromatic number of extended neighborhood corona of complete graph with some graphs ⋮ On r- dynamic coloring of the family of bistar graphs ⋮ On the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graph ⋮ On r− dynamic coloring of the gear graph families
Cites Work
- Unnamed Item
- Unnamed Item
- On \(r\)-dynamic coloring of graphs
- On the difference between chromatic number and dynamic chromatic number of graphs
- On the dynamic coloring of graphs
- Dynamic chromatic number of regular graphs
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number
- Extremal problems for transversals in graphs with bounded degree
- Hypergraph colouring and the Lovász local lemma
- Dynamic coloring and list dynamic coloring of planar graphs
This page was built for publication: On \(r\)-dynamic chromatic number of graphs