Graph Ear Decompositions and Graph Embeddings

Authors:
Jianer Chen;Saroja P. Kanchi
Affiliations:
-;-
Venue:
SIAM Journal on Discrete Mathematics
Year:
1999

Citing 0
Cited 2

Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture

WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Note: A note on the computational complexity of graph vertex partition

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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 maximum-paired ear decomposition of a graph and constructing a maximum-genus embedding of the graph are polynomial-time equivalent. Applications of this connection are discussed.