The cyclic coloring problem and estimation of spare hessian matrices
SIAM Journal on Algebraic and Discrete Methods
Comparing queues and stacks as mechanisms for laying out graphs
SIAM Journal on Discrete Mathematics
Laying out graphs using queues
SIAM Journal on Computing
Efficiently four-coloring planar graphs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Acyclic colorings of subcubic graphs
Information Processing Letters
Layout of Graphs with Bounded Tree-Width
SIAM Journal on Computing
Track layouts of graphs
Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
INFORMS Journal on Computing
Random Structures & Algorithms
Acyclically 3-colorable planar graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Acyclic coloring with few division vertices
Journal of Discrete Algorithms
| Hi-index | 0.00 |
In this paper we study the acyclic 3-colorability of some subclasses of planar graphs. First, we show that there exist infinite classes of cubic planar graphs that are not acyclically 3-colorable. Then, we show that every planar graph has a subdivision with one vertex per edge that is acyclically 3-colorable and provide a linear-time coloring algorithm. Finally, we characterize the series-parallel graphs for which every 3-coloring is acyclic and provide a linear-time recognition algorithm for such graphs.