Graph Ear Decompositions and Graph Embeddings

DOI10.1137/S0895480196304234zbMath0944.05026MaRDI QIDQ4255818

Saroja P. Kanchi, Jian'er Chen

Publication date: 27 June 1999

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmgraph connectivityear decompositiongraph embeddinggraph maximum genus

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Related Items (3)

A note on the computational complexity of graph vertex partition ⋮ Algorithmic graph embeddings ⋮ Algorithmic graph embeddings

This page was built for publication: Graph Ear Decompositions and Graph Embeddings