Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges

DOI10.1007/978-3-540-92248-3_14zbMath1202.05027OpenAlexW1537416801MaRDI QIDQ5302051

No author found.

Publication date: 20 January 2009

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-92248-3_14

zbMATH Keywords

SEFEfixed edgesbiconnected outerplanar graphssimultanneous embeddingsimutaneous drawing

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (5)

Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph ⋮ Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree ⋮ Colored simultaneous geometric embeddings and universal pointsets ⋮ An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges

Cites Work

• Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
• How to draw a planar graph on a grid
• On simultaneous planar graph embeddings
• A linear algorithm for embedding planar graphs using PQ-trees
• Simultaneous Graph Embeddings with Fixed Edges
• Embedding Graphs Simultaneously with Fixed Edges
• Colored Simultaneous Geometric Embeddings
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Simultaneous Geometric Graph Embeddings
• Graph Drawing
• Embedding planar graphs at fixed vertex locations

This page was built for publication: Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges