Abstract
Acyclic-coloring of a graph G = (V,E) is a partitioning of V, such that the induced subgraph of each partition is acyclic. The minimum number of such partitions of V is defined as the vertex arboricity of G. A linear time algorithm for acyclic-coloring of planar graphs with 3 colors is presented. Next, an O(n2) algorithm is proposed which produces a valid acyclic-2-coloring of a planar graph, if one exists, since there are planar graphs with arboricity 3.
Keywords
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
I. Broere and C.M. Mynhardt, Generalized colorings of planar and outerplanar graphs, Y. Alavi et al., eds., Graph Theory with Applications to Algorithms and Computer Science(Wiley, New York, 1985), pp 151–161.
W. Goddard, Acyclic colorings of planar graphs, Discrete Mathematics 91, 1991, pp 91–94.
V.D. Agrawal, S. Seth and J.S. Deogun, Design for testability and test generation with 2 clocks, Univ. of Nebraska-Lincoln, Dept. of Comp. Sc. Engg, Report series #102, Feb 1990.
M. Garey and D.S. Johnson, Computers and Intractability: A complete guide to NP-completeness, Freeman, 1979.
G. Chartrand and H.V. Kronk, The point arboricity of planar graphs, Journal of London Math. Soc., Vol 44, Part 4, Oct 1969.
F. Harary, Graph theory, Addison Wesley Publishing Co., 1969.
T. Nishizeki and N. Chiba, Planar graphs: theory and algorithms, North Holland Mathematics Studies 140, 1988.
A. Roychoudhury, Cycle-coloring of planar and general graphs with applications to VLSI testing, BCSE Project Report, Jadavpur University, Dept. of Computer Sc. Engg., May 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Roychoudhury, A., Sur-Kolay, S. (1995). Efficient algorithms for vertex arboricity of planar graphs. In: Thiagarajan, P.S. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1995. Lecture Notes in Computer Science, vol 1026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60692-0_39
Download citation
DOI: https://doi.org/10.1007/3-540-60692-0_39
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60692-5
Online ISBN: 978-3-540-49263-4
eBook Packages: Springer Book Archive