Acyclic Coloring with Few Division Vertices [chapter]

Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman, Sue Whitesides
2012 Lecture Notes in Computer Science  
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
more » ... vely, 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.
doi:10.1007/978-3-642-35926-2_11 fatcat:b6kdafg26zajzexo3qr45ms5ge