On the dynamic coloring of graphs

From MaRDI portal
Revision as of 08:05, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:617650

DOI10.1016/j.dam.2010.10.012zbMath1203.05046arXiv0908.2543OpenAlexW2074480183MaRDI QIDQ617650

Meysam Alishahi

Publication date: 21 January 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0908.2543




Related Items (24)

Element deletion changes in dynamic coloring of graphsOn \(r\)-dynamic coloring of graphsDynamic coloring of graphs having no \(K_5\) minorOn the \(r\)-dynamic coloring of subdivision-edge coronas of a pathOn the \(r\)-dynamic coloring of the direct product of a path with either a complete graph or a wheel graphOn the \(r\)-dynamic coloring of the direct product of a path with either a path or a cycleDynamic list coloring of 1-planar graphsGraph \(r\)-hued colorings -- a surveyLinear list r-hued coloring of sparse graphsOn \(r\)-hued colorings of graphs without short induced pathsWeak dynamic coloring of planar graphsThe $r$-dynamic edge coloring of a closed helm graphOn dynamic coloring for planar graphs and graphs of higher genusOn \(r\)-dynamic chromatic number of graphsList \(r\)-hued chromatic number of graphs with bounded maximum average degreesDynamic coloring and list dynamic coloring of planar graphsA counterexample to montgomery's conjecture on dynamic colourings of regular graphsDynamic chromatic number of regular graphs3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphsAdynamic coloring of graphsr-Dynamic coloring of the corona product of graphsOn \(r\)-dynamic coloring of gridsOn the r-dynamic coloring of the direct product of a path and a k-subdivision of a star graphThe structure and the list 3-dynamic coloring of outer-1-planar graphs



Cites Work




This page was built for publication: On the dynamic coloring of graphs