Graph ear decompositions and graph embeddings

Extended abstract
  • Jianer Chen
  • Saroja P. Kanchi
Conference paper

DOI: 10.1007/3-540-57899-4_67

Part of the Lecture Notes in Computer Science book series (LNCS, volume 790)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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