Abstract
An acyclic k-coloring of a graph G is a mapping φ from the set of vertices of G to a set of k distinct colors such that no two adjacent vertices receive the same color and φ does not contain any bichromatic cycle. In this paper we prove that every triangulated plane graph with n vertices has a 1-subdivision that is acyclically 3-colorable (respectively, 4-colorable), where the number of division vertices is at most 2n − 5 (respectively, 1.5n − 3.5). On the other hand, we prove an 1.28n (respectively, 0.3n) lower bound on the number of division vertices for acyclic 3-colorings (respectively, 4-colorings) of triangulated planar graphs. Furthermore, we establish the NP-completeness of deciding acyclic 4-colorability for graphs with the maximum degree 5 and for planar graphs with the maximum degree 7.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Albertson, M.O., Berman, D.M.: Every planar graph has an acyclic 7-coloring. Israel Journal of Mathematics 28(1–2), 169–174 (1977)
Alon, N., McDiarmid, C., Reed, B.A.: Acyclic coloring of graphs. Random Struct. Algorithms 2(3), 277–288 (1991)
Angelini, P., Frati, F.: Acyclically 3-Colorable Planar Graphs. In: Rahman, M. S., Fujita, S. (eds.) WALCOM 2010. LNCS, vol. 5942, pp. 113–124. Springer, Heidelberg (2010)
Di Battista, G., Frati, F., Pach, J.: On the queue number of planar graphs. In: 51th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2010), pp. 365–374 (2010)
Borodin, O.V., Ivanova, A.O.: Acyclic 5-choosability of planar graphs without adjacent short cycles. Journal of Graph Theory 68(2), 169–176 (2011)
Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Mathematics 306(10–11), 953–972 (2006)
Burnstein, M.I.: Every 4-valent graph has an acyclic 5-coloring. Soobsc Akad. Nauk Grucin 93, 21–24 (1979)
Dailey, D.P.: Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete. Discrete Mathematics 30(3), 289 (1980)
Dujmović, V., Wood, D.R.: Three-dimensional grid drawings with sub-quadratic volume. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemporary Mathematics. American Mathematical Society (2004)
Dujmović, V., Morin, P., Wood, D.R.: Layout of graphs with bounded tree-width. SIAM Journal of Computing 34, 553–579 (2005)
Fertin, G., Godard, E., Raspaud, A.: Minimum feedback vertex set and acyclic coloring. Inf. Process. Lett. 84(3), 131–139 (2002)
Gebremedhin, A.H., Tarafdar, A., Pothen, A., Walther, A.: Efficient computation of sparse hessians using coloring and automatic differentiation. INFORMS Journal on Computing 21, 209–223 (2009)
Grünbaum, B.: Acyclic colorings of planar graphs. Israel Journal of Mathematics 14(4), 390–408 (1973)
Hocquard, H.: Graphs with maximum degree 6 are acyclically 11-colorable. Inf. Process. Lett. 111(15), 748–753 (2011)
Kostochka, A.V.: Acyclic 6-coloring of planar graphs. Diskretn. Anal. 28, 40–56 (1976)
Kostochka, A.V., Stocker, C.: Graphs with maximum degree 5 are acyclically 7-colorable. Ars Mathematica Contemporanea 4(1), 153–164 (2011)
Mitchem, J.: Every planar graph has an acyclic 8-coloring. Duke Mathematical Journal 41(1), 177–181 (1974)
Mondal, D., Nishat, R.I., Whitesides, S., Rahman, M. S.: Acyclic Colorings of Graph Subdivisions. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol. 7056, pp. 247–260. Springer, Heidelberg (2011)
Mondal, D., Nishat, R.I., Whitesides, S., Rahman, M.S.: Acyclic colorings of graph subdivisions revisited. Journal of Discrete Algorithms (to appear, 2012)
Nishat, R.I.: Acyclic 3-colorings and 4-colorings of planar graph subdivisions, http://www.iwoca.org/main_iwocaproblems.php (accessed July 2012)
Nishizeki, T., Rahman, M.S.: Planar Graph Drawing. World Scientific (2004)
Ochem, P.: Negative results on acyclic improper colorings. In: European Conference on Combinatorics (EuroComb 2005), pp. 357–362 (2005)
Skulrattanakulchai, S.: Acyclic colorings of subcubic graphs. Information Processing Letters 92(4), 161–167 (2004)
Wood, D.R.: Acyclic, star and oriented colourings of graph subdivisions. Discrete Mathematics & Theoretical Computer Science 7(1), 37–50 (2005)
Zhang, H., He, X.: Canonical ordering trees and their applications in graph drawing. Discrete & Computational Geometry 33(2), 321–344 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mondal, D., Nishat, R.I., Rahman, M.S., Whitesides, S. (2012). Acyclic Coloring with Few Division Vertices. In: Arumugam, S., Smyth, W.F. (eds) Combinatorial Algorithms. IWOCA 2012. Lecture Notes in Computer Science, vol 7643. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35926-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-35926-2_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35925-5
Online ISBN: 978-3-642-35926-2
eBook Packages: Computer ScienceComputer Science (R0)