Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms

ISA 1991: ISA'91 Algorithms pp 12–21Cite as

Algorithms for square roots of graphs

Extended abstract

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Aho, M. Garey, and J. Ullman. The transitive reduction of a directed graph. SIAM J. Computing, 1:131–137, 1972.

    Google Scholar 

  2. M. Behzad. A criterion for the planarity of a total graph. Proc. Cambridge Philos. Soc., 63:679–681, 1967.

    Google Scholar 

  3. F. Escalante, L. Montejano, and T. Rojano. Characterization of n-path graphs and of graphs having nth root. J. Combin. Theory B, 16:282–289, 1974.

    Google Scholar 

  4. H. Fleischner. The square of every two-connected graph is Hamiltonian. J. Combin. Theory B, 16:29–34, 1974.

    Google Scholar 

  5. M. R. Garey and D. S. Johnson. Computers and Intractability — A guide to the Theory of NP-Completeness. Freeman, New York, 1979.

    Google Scholar 

  6. F. Gavril. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combin. Theory B, 16:47–56, 1974.

    Google Scholar 

  7. D. P. Geller. The square root of a digraph. J. Combin. Theory, 5:320–321, 1968.

    Google Scholar 

  8. M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980.

    Google Scholar 

  9. F. Harary. Graph Theory. Addison-Wesley, Massachusetts, 1972.

    Google Scholar 

  10. F. Harary, R. M. Karp, and W. T. Tutte. A criterion for planarity of the square of a graph. J. Combin. Theory, 2:395–405, 1967.

    Google Scholar 

  11. F. Harary and A. Schwenk. Trees with hamiltonian square. Mathematika, 18:138–140, 1971.

    Google Scholar 

  12. G. Hendry and W. Vogler. The square of a connected S(K 1,3)-free graph is vertex pancyclic. J. Graph Theory, 9:535–537, 1985.

    Google Scholar 

  13. J. E. Hopcroft and R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Computing, 2:135–158, 1973.

    Google Scholar 

  14. M. Matthews and D. Summer. Hamiltonina results in S(K 1,3)-free graphs. J. Graph Theory, 8:139–146, 1984.

    Google Scholar 

  15. A. Mukhopadhyay. The square root of a graph. J. Combin. Theory, 2:290–295, 1967.

    Google Scholar 

  16. I. C. Ross and F. Harary. The square of a tree. Bell System Tech. J., 39:641–647, 1960.

    Google Scholar 

  17. M. Sekanina. On an ordering of the set of vertices of a connected graph. Technical Report No. 412, Publ. Fac. Sci. Univ. Brno, 1960.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, State University of New York, 11794-4400, Stony Brook, NY

    Yaw-Ling Lin & Steven S. Skiena

Authors
  1. Yaw-Ling Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Steven S. Skiena
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wen-Lian Hsu R. C. T. Lee

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lin, YL., Skiena, S.S. (1991). Algorithms for square roots of graphs. In: Hsu, WL., Lee, R.C.T. (eds) ISA'91 Algorithms. ISA 1991. Lecture Notes in Computer Science, vol 557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54945-5_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-54945-5_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54945-1

  • Online ISBN: 978-3-540-46600-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation