Constrained Simultaneous and Near-Simultaneous Embeddings
From MaRDI portal
Publication:5452230
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Recommendations
Cites work
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- A characterization of level planar graphs
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Drawing graphs. Methods and models
- Embedding Graphs Simultaneously with Fixed Edges
- Graph Drawing
- Graph Drawing
- Level Planar Embedding in Linear Time
- On simultaneous planar graph embeddings
Cited in
(8)- Colored simultaneous geometric embeddings and universal pointsets
- Constrained simultaneous and near-simultaneous embeddings
- Embeddability Problems for Upward Planar Digraphs
- Geometric simultaneous embeddings of a graph and a matching
- Matched Drawability of Graph Pairs and of Graph Triples
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Critical imbeddings with multivariate rearrangements
- Simultaneous Embedding
This page was built for publication: Constrained Simultaneous and Near-Simultaneous Embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5452230)