Acyclic coloring with few division vertices

Albertson, 1977, Every planar graph has an acyclic 7-coloring, Israel Journal of Mathematics, 28, 169, 10.1007/BF02759792 Alon, 1991, Acyclic coloring of graphs, Random Structures & Algorithms, 2, 277, 10.1002/rsa.3240020303 Angelini, 2012, Acyclically 3-colorable planar graphs, Journal of Combinatorial Optimization, 24, 116, 10.1007/s10878-011-9385-3 Borodin, 2006, On acyclic colorings of planar graphs, Discrete Mathematics, 306, 953, 10.1016/j.disc.2006.03.017 Borodin, 2011, Acyclic 5-choosability of planar graphs without adjacent short cycles, Journal of Graph Theory, 68, 169, 10.1002/jgt.20549 Burnstein, 1979, Every 4-valent graph has an acyclic 5-coloring, Soobsč. Akad. Nauk Gruzin. SSR, 93, 21 Coleman, 1986, The cyclic coloring problem and estimation of sparse Hessian matrices, SIAM Journal on Algebraic and Discrete Methods, 7, 221, 10.1137/0607026 Dailey, 1980, Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete, Discrete Mathematics, 30, 289, 10.1016/0012-365X(80)90236-8 de Fraysseix, 1990, How to draw a planar graph on a grid, Combinatorica, 10, 41, 10.1007/BF02122694 Di Battista, 2010, On the queue number of planar graphs, 365 Dieng, 2010, Acyclic coloring of graphs with maximum degree bounded Dujmović, 2005, Layout of graphs with bounded tree-width, SIAM Journal on Computing, 34, 553, 10.1137/S0097539702416141 Dujmović, 2004, Three-dimensional grid drawings with sub-quadratic volume Fertin, 2002, Minimum feedback vertex set and acyclic coloring, Information Processing Letters, 84, 131, 10.1016/S0020-0190(02)00265-X Gebremedhin, 2009, Efficient computation of sparse Hessians using coloring and automatic differentiation, INFORMS Journal on Computing, 21, 209, 10.1287/ijoc.1080.0286 Grünbaum, 1973, Acyclic colorings of planar graphs, Israel Journal of Mathematics, 14, 390, 10.1007/BF02764716 Hocquard, 2011, Graphs with maximum degree 6 are acyclically 11-colorable, Information Processing Letters, 111, 748, 10.1016/j.ipl.2011.05.005 Kostochka, 1976, Acyclic 6-coloring of planar graphs, Diskretnyj Analiz, 28, 40 Kostochka, 1978 Kostochka, 2011, Graphs with maximum degree 5 are acyclically 7-colorable, Ars Mathematica Contemporanea, 4, 153, 10.26493/1855-3974.198.541 Mitchem, 1974, Every planar graph has an acyclic 8-coloring, Duke Mathematical Journal, 41, 177, 10.1215/S0012-7094-74-04119-2 Mondal, 2012, Acyclic coloring with few division vertices, vol. 7643, 86 Mondal, 2011, Acyclic colorings of graph subdivisions, vol. 7056, 247 Mondal, 2012, Acyclic colorings of graph subdivisions revisited, Journal of Discrete Algorithms, 16, 90, 10.1016/j.jda.2012.06.001 Nishat Ochem, 2005, Negative results on acyclic improper colorings, vol. AE, 357 Schnyder, 1990, Embedding planar graphs on the grid, 138 Skulrattanakulchai, 2004, Acyclic colorings of subcubic graphs, Information Processing Letters, 92, 161, 10.1016/j.ipl.2004.08.002 Wood, 2005, Acyclic, star and oriented colourings of graph subdivisions, Discrete Mathematics and Theoretical Computer Science, 7, 37, 10.46298/dmtcs.344 Zhang, 2005, Canonical ordering trees and their applications in graph drawing, Discrete & Computational Geometry, 33, 321, 10.1007/s00454-004-1154-y