Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
From MaRDI portal
Publication:634247
DOI10.1016/j.comgeo.2011.02.002zbMath1223.05041OpenAlexW2033330193MaRDI QIDQ634247
Publication date: 2 August 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.02.002
Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (3)
Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges ⋮ SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS ⋮ Disconnectivity and relative positions in simultaneous embeddings
Cites Work
- Unnamed Item
- How to draw a planar graph on a grid
- On simultaneous planar graph embeddings
- A linear algorithm for embedding planar graphs using PQ-trees
- Bemerkungen zum Vierfarbenproblem
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Simultaneous Graph Embeddings with Fixed Edges
- Characterization of Unlabeled Level Planar Trees
- Simultaneous Graph Embedding with Bends and Circular Arcs
- Embedding Graphs Simultaneously with Fixed Edges
- Colored Simultaneous Geometric Embeddings
- An Optimal Algorithm for Euclidean Shortest Paths in the Plane
- Characterizing Simultaneous Embedding with Fixed Edges
- Simultaneous Embedding of Planar Graphs with Few Bends
- Planarity Testing and Optimal Edge Insertion with Embedding Constraints
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- The geometric thickness of low degree graphs
- Characterization of Unlabeled Level Planar Graphs
- Simultaneous Geometric Graph Embeddings
- Convex Maps
- 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
