Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
DOI10.1007/978-3-642-19222-7_22zbMATH Open1326.68207OpenAlexW1671232646MaRDI QIDQ3000509FDOQ3000509
Authors: Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter 
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
Recommendations
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- Simultaneous embedding of embedded planar graphs
- Characterizing simultaneous embedding with fixed edges
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
Graph algorithms (graph-theoretic aspects) (05C85) 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)
Cites Work
- Title not available (Why is that?)
- On-Line Planarity Testing
- On a tree and a path with no geometric simultaneous embedding
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- On simultaneous planar graph embeddings
- Testing planarity of partially embedded graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- On-line maintenance of triconnected components with SPQR-trees
- Two trees which are self-intersecting when drawn simultaneously
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- 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
- 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
Cited In (4)
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- Testing simultaneous planarity when the common graph is 2-connected
- Advancements on SEFE and partitioned book embedding problems
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
This page was built for publication: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000509)
