Graph ear decompositions and graph embeddings
- First Online:
- Cite this paper as:
- 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
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.