3-dynamic coloring of planar triangulations
From MaRDI portal
Publication:1783610
DOI10.1016/j.disc.2018.07.020zbMath1395.05055OpenAlexW2887370004MaRDI QIDQ1783610
Atsuhiro Nakamoto, Kenta Ozeki, Yuki Kawasaki, Yoshihiro Asayama, Seog-Jin Kim
Publication date: 21 September 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2018.07.020
Related Items (3)
Graph \(r\)-hued colorings -- a survey ⋮ The list \(r\)-hued coloring of \(K_{m, n}\) ⋮ On list 3-dynamic coloring of near-triangulations
Cites Work
- On \(r\)-dynamic coloring of graphs
- On \(r\)-hued coloring of \(K_4\)-minor free graphs
- On \(r\)-hued coloring of planar graphs with girth at least 6
- Coloring the square of graphs whose maximum average degree is less than 4
- Dynamic coloring parameters for graphs with given genus
- \(r\)-hued coloring of sparse graphs
- List 3-dynamic coloring of graphs with small maximum average degree
- 3-dynamic coloring and list 3-dynamic coloring of \(K_{1, 3}\)-free graphs
- A counterexample to montgomery's conjecture on dynamic colourings of regular graphs
- On \(r\)-dynamic coloring of grids
- Mr. Paint and Mrs. Correct
- On-line list colouring of graphs
- Coloring squares of planar graphs with girth six
- Dynamic coloring and list dynamic coloring of planar graphs
- A bound on the chromatic number of the square of a planar graph
This page was built for publication: 3-dynamic coloring of planar triangulations
