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

DOI10.1007/978-3-642-19222-7_22MaRDI QIDQ3000509zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 2080088 (Why is no real title available?)
• An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
• Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
• Embedding Graphs Simultaneously with Fixed Edges
• Intersection Graphs in Simultaneous Embedding with Fixed Edges
• On a tree and a path with no geometric simultaneous embedding
• On simultaneous planar graph embeddings
• On-Line Planarity Testing
• On-line maintenance of triconnected components with SPQR-trees
• SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
• Simultaneous Embedding of Planar Graphs with Few Bends
• Simultaneous Geometric Graph Embeddings
• Simultaneous Graph Embeddings with Fixed Edges
• Testing planarity of partially embedded graphs
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Two trees which are self-intersecting when drawn simultaneously

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)