Dynamic list coloring of bipartite graphs
From MaRDI portal
Publication:608280
DOI10.1016/j.dam.2010.08.007zbMath1215.05062OpenAlexW2094576488MaRDI QIDQ608280
Publication date: 25 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.08.007
Related Items (16)
Element deletion changes in dynamic coloring of graphs ⋮ Dynamic list coloring of 1-planar graphs ⋮ Graph \(r\)-hued colorings -- a survey ⋮ Linear list r-hued coloring of sparse graphs ⋮ On \(r\)-hued coloring of \(K_4\)-minor free graphs ⋮ On the dynamic coloring of graphs ⋮ On \(r\)-hued colorings of graphs without short induced paths ⋮ On dynamic coloring for planar graphs and graphs of higher genus ⋮ On the difference between chromatic number and dynamic chromatic number of graphs ⋮ On list 3-dynamic coloring of near-triangulations ⋮ List \(r\)-hued chromatic number of graphs with bounded maximum average degrees ⋮ List 3-dynamic coloring of graphs with small maximum average degree ⋮ Dynamic coloring and list dynamic coloring of planar graphs ⋮ Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number ⋮ 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs ⋮ The structure and the list 3-dynamic coloring of outer-1-planar graphs
Cites Work
This page was built for publication: Dynamic list coloring of bipartite graphs
