Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
DOI10.1007/978-3-642-19222-7_22zbMath1326.68207OpenAlexW1671232646MaRDI QIDQ3000509
Patrizio Angelini, Fabrizio Frati, Ignaz Rutter, Giuseppe Di Battista, Maurizio Patrignani
Publication date: 19 May 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-19222-7_22
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Cites Work
- Unnamed Item
- Unnamed Item
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- On simultaneous planar graph embeddings
- Two trees which are self-intersecting when drawn simultaneously
- On-line maintenance of triconnected components with SPQR-trees
- On a Tree and a Path with no Geometric Simultaneous Embedding
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Simultaneous Graph Embeddings with Fixed Edges
- Embedding Graphs Simultaneously with Fixed Edges
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- On-Line Planarity Testing
- Simultaneous Embedding of Planar Graphs with Few Bends
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Simultaneous Geometric Graph Embeddings
This page was built for publication: Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree
