Acyclic colorings of graph subdivisions revisited

Journal of Discrete Algorithms - Tập 16 - Trang 90-103 - 2012
Debajyoti Mondal1, Rahnuma Islam Nishat2, Sue Whitesides2, Md. Saidur Rahman3
1Department of Computer Science, University of Manitoba, Canada
2Department of Computer Science, University of Victoria, Canada
3Graph Drawing and Information Visualization Laboratory, Department of Computer Science and Engineering, Bangladesh University of Engineering and Technology, Bangladesh

Tài liệu tham khảo

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 and Algorithms, 2, 277, 10.1002/rsa.3240020303 Angelini, 2010, Acyclically 3-colorable planar graphs, vol. 5942, 113 Borodin, 2006, On acyclic colorings of planar graphs, Discrete Mathematics, 306, 953, 10.1016/j.disc.2006.03.017 Coleman, 1986, The cyclic coloring problem and estimation of sparse hessian matrices, SIAM Journal on Algebraic and Discrete Methods, 7, 221, 10.1137/0607026 de Fraysseix, 1990, How to draw a planar graph on a grid, Combinatorica, 10, 41, 10.1007/BF02122694 Dhandapani, 2010, Greedy drawings of triangulations, Discrete & Computational Geometry, 43, 375, 10.1007/s00454-009-9235-6 G. Di Battista, F. Frati, J. Pach, On the queue number of planar graphs, in: 51st Annual IEEE Symposium on Foundations of Computer Science (FOCS ʼ10), 2010, pp. 365–374. Dujmović, 2005, Layout of graphs with bounded tree-width, SIAM Journal of Computing, 34, 553, 10.1137/S0097539702416141 Dujmović, 2004, Three-dimensional grid drawings with sub-quadratic volume 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 Kostochka, 1976, Acyclic 6-coloring of planar graphs, Diskretnyi Analiz, 28, 40 Mitchem, 1974, Every planar graph has an acyclic 8-coloring, Duke Mathematical Journal, 41, 177, 10.1215/S0012-7094-74-04119-2 Miura, 2005, Canonical decomposition, realizer, Schnyder labeling and orderly spanning trees of plane graphs, International Journal of Foundations of Computer Science, 16, 117, 10.1142/S0129054105002905 Mondal, 2011, Acyclic colorings of graph subdivisions, vol. 7056, 247 Nishizeki, 2004 P. Ochem, Negative results on acyclic improper colorings, in: European Conference on Combinatorics (EuroComb ʼ05), 2005, pp. 357–362. 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 & Theoretical Computer Science, 7, 37, 10.46298/dmtcs.344