Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
DOI10.1016/J.JDA.2011.12.015zbMATH Open1247.05156OpenAlexW1985459410WikidataQ56689204 ScholiaQ56689204MaRDI QIDQ450560FDOQ450560
Authors: Patrizio Angelini, Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Ignaz Rutter 
Publication date: 13 September 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2011.12.015
Recommendations
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- Intersection Graphs in Simultaneous Embedding with Fixed Edges
- Disconnectivity and relative positions in simultaneous embeddings
- Simultaneous embedding of embedded planar graphs
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A linear-time algorithm for a special case of disjoint set union
- Title not available (Why is that?)
- On-Line Planarity Testing
- Fast Algorithms for Finding Nearest Common Ancestors
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- On simultaneous planar graph embeddings
- Testing planarity of partially embedded graphs
- On-line maintenance of triconnected components with SPQR-trees
- Two trees which are self-intersecting when drawn simultaneously
- Testing simultaneous planarity when the common graph is 2-connected
- On a tree and a path with no geometric simultaneous embedding
- 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 (28)
- Clustered planarity = flat clustered planarity
- On 3-coloring circle graphs
- An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
- An annotated review on graph drawing and its applications
- Disconnectivity and relative positions in simultaneous embeddings
- Relaxing the constraints of clustered planarity
- Simultaneous orthogonal planarity
- Simpler algorithms for testing two-page book embedding of partitioned graphs
- Simultaneous embedding of embedded planar graphs
- Upward book embeddings of st-graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- Disconnectivity and relative positions in simultaneous embeddings
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Title not available (Why is that?)
- Stack-number is not bounded by queue-number
- Atomic Embeddability, Clustered Planarity, and Thickenability
- On 3-coloring circle graphs
- Testing simultaneous planarity when the common graph is 2-connected
- An annotated bibliography on 1-planarity
- Testing bipartiteness of geometric intersection graphs
- The importance of being proper
- Simultaneous embeddings with few bends and crossings
- Testing simultaneous planarity when the common graph is 2-connected
- Algorithms and bounds for drawing non-planar graphs with crossing-free subgraphs
- Simultaneous Embedding
- Drawing Simultaneously Embedded Graphs with Few Bends
- Advancements on SEFE and partitioned book embedding problems
- Topological morphing of planar graphs
This page was built for publication: Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q450560)
