Minimum feedback vertex set and acyclic coloring
Information Processing Letters
Acyclic edge colorings of graphs
Journal of Graph Theory
Acyclic list 7-coloring of planar graphs
Journal of Graph Theory
Random Structures & Algorithms
Hi-index | 0.89 |
It is known that the acyclic chromatic number of a subcubic graph is at most four, and its acyclic edge chromatic number is at most five. We present algorithms that prove these two facts. Let n be the number of vertices of a graph. Our first algorithm takes O(n) time and uses four colors to properly color the vertices of any subcubic graph so that there is no 2-colored cycle. Our second algorithm takes O(n) time and uses five colors to properly color the edges of any subcubic graph so that there is no 2-colored cycle. Both are the first linear-time algorithms for the problems they solve.