Abstract
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.
Supported in part by the National Science Foundation under Grant CCR-9110824.
Supported in part by the Engineering Excellence Award from Texas A&M University.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Chen, J.: A linear time algorithm for isomorphism of graphs of bounded average genus. Lecture Notes in Computer Science 657 (1993) 103–113
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–103
Chen, J., Gross, J. L.: Kuratowski-type theorems for average genus. J. Comb. Theory Ser. B 57 (1993) 100–211
Chen, J., Gross, J. L., and Rieper, R. G.: Overlap matrices and imbedding distributions. Discrete Mathematics (1993) to appear
Chen, J. and Kanevsky, A.: On assembly of 4-connected graphs. Lecture Notes in Computer Science 657 (1993) 158–169
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)
Cheriyan, J. and Maheshwari, S. N.: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J. Algorithms 9 (1988) 507–537
Furst, M., Gross, J. L., and McGeoch, L. A.: Finding a maximum-genus graph imbedding. J. ACM 35-3 (1988) 523–534
Gabow, H. N. and Stallmann, M.: Efficient algorithms for graphic matroid intersection and parity. Lecture Notes in Computer Science 194 (1985) 210–220
Gross, J. L., Tucker, T. W.: Topological Graph Theory. Wiley-Interscience, New York (1987)
Kanevsky, A. and Ramachandran, V.: Improved algorithms for graph four-connectivity. J. Computer and System Sciences 42 (1991) 288–306
Lovasz, L.: Computing ears and branchings in parallel. Proc. 26th Annual IEEE Symposium on Foundations of Computer Science (1985) 464–467
Nordhaus, E., Stewart, B., and White, A.: On the maximum genus of a graph. J. Comb. Theory Ser. B 11 (1971) 258–267
Preparata, F. P. and Shamos, M. I.: Computational Geometry: An Introduction. Springer-Verlag (1985)
Ramachandran, V.: Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. in Synthesis of Parallel Algorithms, Ed. Reif, Morgan-Kaufmann (1993)
Ringeisen, R.: Survey of results on the maximum genus of a graph. J. Graph Theory 3 (1979) 1–13
Schieber, B. and Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Computing 17 (1988) 1253–1262
Slater, P. J.: A classification of 4-connected graphs. J. Comb. Theory Ser. B 17 (1974) 281–298
Whitney, H.: Non-separable and planar graphs. Trans. Amer. Math. Soc. 34 (1932) 339–362
Xuong, N. H.: How to determine the maximum genus of a graph. J. Comb. Theory Ser. B 26 (1979) 217–225
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Kanchi, S.P. (1994). Graph ear decompositions and graph embeddings. In: van Leeuwen, J. (eds) Graph-Theoretic Concepts in Computer Science. WG 1993. Lecture Notes in Computer Science, vol 790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57899-4_67
Download citation
DOI: https://doi.org/10.1007/3-540-57899-4_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57899-4
Online ISBN: 978-3-540-48385-4
eBook Packages: Springer Book Archive