Chapter

Graph-Theoretic Concepts in Computer Science

Volume 790 of the series Lecture Notes in Computer Science pp 376-387

Date:

Graph ear decompositions and graph embeddings

Extended abstract
  • Jianer ChenAffiliated withDepartment of Computer Science, Texas A&M University
  • , Saroja P. KanchiAffiliated withDepartment of Computer Science, Texas A&M University

* Final gross prices may vary according to local VAT.

Get Access

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.