Graph ear decompositions and graph embeddings

Extended abstract
  • Jianer Chen
  • Saroja P. Kanchi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 790)


Ear decomposition of a graph has been extensively studied in relation to graph connectivity. In this paper, a connection of ear decomposition to graph embeddings is exhibited. It is shown that constructing a maximumpaired ear decomposition of a graph and constructing a maximum-genus embedding of the graph are O (e log n)-time equivalent. This gives a polynomial time algorithm for constructing a maximum-paired ear decomposition.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chen, J.: A linear time algorithm for isomorphism of graphs of bounded average genus. Lecture Notes in Computer Science 657 (1993) 103–113Google Scholar
  2. 2.
    Chen, J., Gross, J. L.: Limit points for average genus (I): 3-connected and 2-connected simplicial graphs. J. Comb. Theory Ser. B 55 (1992) 83–103Google Scholar
  3. 3.
    Chen, J., Gross, J. L.: Kuratowski-type theorems for average genus. J. Comb. Theory Ser. B 57 (1993) 100–211Google Scholar
  4. 4.
    Chen, J., Gross, J. L., and Rieper, R. G.: Overlap matrices and imbedding distributions. Discrete Mathematics (1993) to appearGoogle Scholar
  5. 5.
    Chen, J. and Kanevsky, A.: On assembly of 4-connected graphs. Lecture Notes in Computer Science 657 (1993) 158–169Google Scholar
  6. 6.
    Chen, J., Kanevsky, A., Tamassia, R.: Linear time construction of 3-connected ear decomposition of a graph, The 22nd Southeastern International Conference on Combinatorics, Graph Theory, and Computing. Baton Rouge, Feb. 11–15 (1991)Google Scholar
  7. 7.
    Cheriyan, J. and Maheshwari, S. N.: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9 (1988) 507–537Google Scholar
  8. 8.
    Furst, M., Gross, J. L., and McGeoch, L. A.: Finding a maximum-genus graph imbedding. J. ACM 35-3 (1988) 523–534Google Scholar
  9. 9.
    Gabow, H. N. and Stallmann, M.: Efficient algorithms for graphic matroid intersection and parity. Lecture Notes in Computer Science 194 (1985) 210–220Google Scholar
  10. 10.
    Gross, J. L., Tucker, T. W.: Topological Graph Theory. Wiley-Interscience, New York (1987)Google Scholar
  11. 11.
    Kanevsky, A. and Ramachandran, V.: Improved algorithms for graph four-connectivity. J. Computer and System Sciences 42 (1991) 288–306Google Scholar
  12. 12.
    Lovasz, L.: Computing ears and branchings in parallel. Proc. 26th Annual IEEE Symposium on Foundations of Computer Science (1985) 464–467Google Scholar
  13. 13.
    Nordhaus, E., Stewart, B., and White, A.: On the maximum genus of a graph. J. Comb. Theory Ser. B 11 (1971) 258–267Google Scholar
  14. 14.
    Preparata, F. P. and Shamos, M. I.: Computational Geometry: An Introduction. Springer-Verlag (1985)Google Scholar
  15. 15.
    Ramachandran, V.: Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. in Synthesis of Parallel Algorithms, Ed. Reif, Morgan-Kaufmann (1993)Google Scholar
  16. 16.
    Ringeisen, R.: Survey of results on the maximum genus of a graph. J. Graph Theory 3 (1979) 1–13Google Scholar
  17. 17.
    Schieber, B. and Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Computing 17 (1988) 1253–1262Google Scholar
  18. 18.
    Slater, P. J.: A classification of 4-connected graphs. J. Comb. Theory Ser. B 17 (1974) 281–298Google Scholar
  19. 19.
    Whitney, H.: Non-separable and planar graphs. Trans. Amer. Math. Soc. 34 (1932) 339–362Google Scholar
  20. 20.
    Xuong, N. H.: How to determine the maximum genus of a graph. J. Comb. Theory Ser. B 26 (1979) 217–225Google Scholar

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Jianer Chen
    • 1
  • Saroja P. Kanchi
    • 1
  1. 1.Department of Computer ScienceTexas A&M UniversityCollege StationUSA

Personalised recommendations