Graph Ear Decompositions and Graph Embeddings

DOI10.1137/S0895480196304234MaRDI QIDQ4255818zbMATH OpenFDO

Authors Saroja P. Kanchi, Jianer Chen

Publication date 27 June 1999

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

Full work available at URL https://doi.org/10.1137/S0895480196304234

zbMATH Keywords

algorithmgraph embeddinggraph connectivityear decompositiongraph maximum genus

Mathematics Subject Classification ID

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

Recommendations

• Graph ear decompositions and graph embeddings
• scientific article; zbMATH DE number 51713
• Embeddings of graphs
• scientific article; zbMATH DE number 1342146
• Algorithms – ESA 2004
• scientific article; zbMATH DE number 4164896
• Algorithmic graph embeddings
• Embedding graphs into embedded graphs
• Embedding Graphs into Embedded Graphs

Cited in

(6)

• Ear decomposition for pair comparison data
• Graph ear decompositions and graph embeddings
• Algorithmic graph embeddings
• Algorithmic graph embeddings
• A note on the computational complexity of graph vertex partition
• Ear decomposition of 3-regular polyhedral links with applications

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4255818)