Skip to main content
SpringerLink
Log in

Efficient algorithms for vertex arboricity of planar graphs

  • Algorithms
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1026))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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.

    Google Scholar 

  2. W. Goddard, Acyclic colorings of planar graphs, Discrete Mathematics 91, 1991, pp 91–94.

    Google Scholar 

  3. 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.

    Google Scholar 

  4. M. Garey and D.S. Johnson, Computers and Intractability: A complete guide to NP-completeness, Freeman, 1979.

    Google Scholar 

  5. G. Chartrand and H.V. Kronk, The point arboricity of planar graphs, Journal of London Math. Soc., Vol 44, Part 4, Oct 1969.

    Google Scholar 

  6. F. Harary, Graph theory, Addison Wesley Publishing Co., 1969.

    Google Scholar 

  7. T. Nishizeki and N. Chiba, Planar graphs: theory and algorithms, North Holland Mathematics Studies 140, 1988.

    Google Scholar 

  8. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Jadavpur University, 700032, Calcutta, India

    Abhik Roychoudhury & Susmita Sur-Kolay

Authors
  1. Abhik Roychoudhury
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Susmita Sur-Kolay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. S. Thiagarajan

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation