On simultaneous planar graph embeddings
From MaRDI portal
Publication:857060
DOI10.1016/j.comgeo.2006.05.006zbMath1105.05015OpenAlexW1999600491WikidataQ56689314 ScholiaQ56689314MaRDI QIDQ857060
Cesim Erten, Stephen G. Kobourov, Joseph S. B. Mitchell, Alon Efrat, Dan P. Ismailescu, Anna Lubiw, Peter Brass, Eowyn Cenek, Christian A. Duncan
Publication date: 14 December 2006
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2006.05.006
Related Items
Simultaneous visibility representations of plane \(st\)-graphs using L-shapes ⋮ Characterizing Simultaneous Embedding with Fixed Edges ⋮ Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices ⋮ Upward Straight-Line Embeddings of Directed Graphs into Point Sets ⋮ Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges ⋮ SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS ⋮ Atomic Embeddability, Clustered Planarity, and Thickenability ⋮ Relating Graph Thickness to Planar Layers and Bend Complexity ⋮ Orthogeodesic Point-Set Embedding of Trees ⋮ On Point-Sets That Support Planar Graphs ⋮ Combining Problems on RAC Drawings and Simultaneous Graph Drawings ⋮ An exponential bound for simultaneous embeddings of planar graphs ⋮ Synchronized Planarity with Applications to Constrained Planarity Problems ⋮ On graph thickness, geometric thickness, and separator theorems ⋮ Partial and simultaneous transitive orientations via modular decompositions ⋮ Small Point-Sets Supporting Graph Stories ⋮ Beyond Level Planarity ⋮ Monotone Simultaneous Embeddings of Paths in d Dimensions ⋮ Small point-sets supporting graph stories ⋮ Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges ⋮ A Note on Universal Point Sets for Planar Graphs ⋮ Graph Stories in Small Area ⋮ The QuaSEFE problem ⋮ A note on universal point sets for planar graphs ⋮ Graph stories in small area ⋮ On the curve complexity of 3-colored point-set embeddings ⋮ Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph ⋮ Compatible spanning trees ⋮ Characterization of unlabeled level planar trees ⋮ Computing Upward Topological Book Embeddings of Upward Planar Digraphs ⋮ Constrained Simultaneous and Near-Simultaneous Embeddings ⋮ Simultaneous visibility representations of undirected pairs of graphs ⋮ Testing the Simultaneous Embeddability of Two Graphs Whose Intersection Is a Biconnected Graph or a Tree ⋮ Computing upward topological book embeddings of upward planar digraphs ⋮ Simultaneous Embeddings with Few Bends and Crossings ⋮ Relaxing the constraints of clustered planarity ⋮ Colored simultaneous geometric embeddings and universal pointsets ⋮ Unnamed Item ⋮ Matched drawability of graph pairs and of graph triples ⋮ Hierarchical partial planarity ⋮ Matched Drawability of Graph Pairs and of Graph Triples ⋮ Beyond level planarity: cyclic, torus, and simultaneous level planarity ⋮ Visual Analysis of One-to-Many Matched Graphs ⋮ Simultaneous embedding of colored graphs ⋮ SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs ⋮ The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs ⋮ Bounded Embeddings of Graphs in the Plane ⋮ Simultaneous Visibility Representations of Plane st-graphs Using L-shapes ⋮ Right Angle Crossing Drawings of Graphs ⋮ Beyond Clustered Planar Graphs ⋮ Plane 3-Trees: Embeddability and Approximation ⋮ On the Complexity of Some Geometric Problems With Fixed Parameters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to draw a planar graph on a grid
- Embedding planar graphs in four pages
- Planar graphs and poset dimension
- The book thickness of a graph
- Drawing the planar dual
- The thickness of graphs: A survey
- Maximum independent set and maximum clique algorithms for overlap graphs
- On embedding an outer-planar graph in a point set
- The Ubiquitous π
- Geometric Thickness of Complete Graphs
- Representations of Planar Graphs
- The geometric thickness of low degree graphs
- How to Draw a Graph
- On a Problem of Heilbronn
- Grid drawings of 4-connected plane graphs
- Drawing graphs. Methods and models