Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph

2011/12/09 by Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati +2 · 1 citation
Computer Science · Mathematics · #1-planar graph #Advanced Graph Theory Research #Biconnected graph #Book embedding #Chordal graph #Combinatorics #Complexity and Algorithms in Graphs #Computational Geometry and Mesh Generation #Computer science #Discrete mathematics #Embedding #Graph #Graph power #Intersection (aeronautics) #Line graph #Mathematics #Outerplanar graph #Pathwidth #Planar graph #Planar straight-line graph #Time complexity #Vertex (graph theory)

paper · pdf · doi:10.1016/j.jda.2011.12.015

openalex publication_date 2011/12/09 · crossref created 2011/12/09 · crossref issued 2012/07/01 · crossref published 2012/07/01 · crossref published-print 2012/07/01 · crossref deposited 2018/11/28 · openalex created_date 2025/10/10 · crossref indexed 2025/10/14 · openalex updated_date 2026/08/02

Citations

• On simultaneous planar graph embeddings
• Fast Algorithms for Finding Nearest Common Ancestors
• A linear-time algorithm for a special case of disjoint set union
• A linear-time algorithm for testing the truth of certain quantified boolean formulas
• On a Tree and a Path with no Geometric Simultaneous Embedding

Cited by

• Book embedding [wikipedia]