Adynamic coloring of graphs
From MaRDI portal
Publication:777385
DOI10.1016/j.dam.2020.03.038zbMath1443.05078OpenAlexW3015171686MaRDI QIDQ777385
Tomáš Madaras, Mária Šurimová, Borut Lužar
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.03.038
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Further extensions of the Grötzsch theorem ⋮ Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On dynamic coloring for planar graphs and graphs of higher genus
- Ore's conjecture on color-critical graphs is almost true
- On the dynamic coloring of graphs
- On the edge-density of 4-critical graphs
- A Brooks-type result for sparse critical graphs
- Short proofs of coloring theorems on planar graphs
- Dynamic coloring and list dynamic coloring of planar graphs
- Grötzsch's theorem on 3-colorings
- The color space of a graph
This page was built for publication: Adynamic coloring of graphs