On simultaneous planar graph embeddings
From MaRDI portal
Publication:857060
DOI10.1016/J.COMGEO.2006.05.006zbMATH Open1105.05015OpenAlexW1999600491WikidataQ56689314 ScholiaQ56689314MaRDI QIDQ857060FDOQ857060
Authors: Peter Brass, Eowyn Cenek, Alon Efrat, Cesim Erten, Dan Ismailescu, Stephen G. Kobourov, Anna Lubiw, Joseph S. B. Mitchell, 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
Recommendations
- Algorithms and Data Structures
- Simultaneous embedding of embedded planar graphs
- Simultaneous embedding of embedded planar graphs
- Graph Drawing
- Simultaneous Embedding of Planar Graphs with Few Bends
- Simultaneous embedding of a planar graph and its dual on the grid
- scientific article; zbMATH DE number 1979531
- Simultaneous Geometric Graph Embeddings
- An exponential bound for simultaneous embeddings of planar graphs
- scientific article; zbMATH DE number 1696626
Cites Work
- Planar graphs and poset dimension
- How to draw a planar graph on a grid
- The book thickness of a graph
- Title not available (Why is that?)
- Drawing graphs. Methods and models
- Embedding planar graphs in four pages
- How to Draw a Graph
- Drawing the planar dual
- Representations of Planar Graphs
- Title not available (Why is that?)
- On embedding an outer-planar graph in a point set
- Grid drawings of 4-connected plane graphs
- The thickness of graphs: A survey
- On a Problem of Heilbronn
- Maximum independent set and maximum clique algorithms for overlap graphs
- Geometric Thickness of Complete Graphs
- The geometric thickness of low degree graphs
- The Ubiquitous π
- Title not available (Why is that?)
Cited In (76)
- A logarithmic bound for simultaneous embeddings of planar graphs
- Graph Stories in Small Area
- Small Point-Sets Supporting Graph Stories
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- Small point-sets supporting graph stories
- Synchronized Planarity with Applications to Constrained Planarity Problems
- Simultaneous embeddings with few bends and crossings
- Graph Simultaneous Embedding Tool, GraphSET
- Partial and simultaneous transitive orientations via modular decompositions
- Two maps on one surface
- Right Angle Crossing Drawings of Graphs
- A Note on Universal Point Sets for Planar Graphs
- Plane embeddings of planar graph metrics
- Column planarity and partially-simultaneous geometric embedding
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Simultaneous visibility representations of undirected pairs of graphs
- SEFE without mapping via large induced outerplane graphs in plane graphs
- Algorithms and Data Structures
- Simultaneous Embedding with Two Bends per Edge in Polynomial Area
- Title not available (Why is that?)
- Graph Drawing
- Simultaneous embeddings with vertices mapping to pre-specified points
- Compatible spanning trees
- Relaxing the constraints of clustered planarity
- On simultaneous straight-line grid embedding of a planar graph and its dual
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices
- Matched drawability of graph pairs and of graph triples
- Monotone simultaneous embeddings of paths in \(d\) dimensions
- Beyond level planarity
- An exponential bound for simultaneous embeddings of planar graphs
- Colored Simultaneous Geometric Embeddings
- Simultaneous representation of proper and unit interval graphs
- Colored simultaneous geometric embeddings and universal pointsets
- Bounded Embeddings of Graphs in the Plane
- Column planarity and partial simultaneous geometric embedding
- Beyond Clustered Planar Graphs
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- Simultaneous embedding of a planar graph and its dual on the grid
- Simultaneous Embedding of Planar Graphs with Few Bends
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Constrained simultaneous and near-simultaneous embeddings
- Geometric simultaneous embeddings of a graph and a matching
- Computing upward topological book embeddings of upward planar digraphs
- Simultaneous Geometric Graph Embeddings
- On point-sets that support planar graphs
- Simultaneous embedding of embedded planar graphs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- Simultaneous embedding of colored graphs
- Relating graph thickness to planar layers and bend complexity
- A note on universal point sets for planar graphs
- On the curve complexity of 3-colored point-set embeddings
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Atomic Embeddability, Clustered Planarity, and Thickenability
- On graph thickness, geometric thickness, and separator theorems
- Simultaneous embeddability of two partitions
- Characterization of unlabeled level planar trees
- On the complexity of some geometric problems with fixed parameters
- Orthogeodesic point-set embedding of trees
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- Geometric simultaneous embeddings of a graph and a matching
- Crossing number of simultaneous embedding of two planar graphs with restriction
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Matched Drawability of Graph Pairs and of Graph Triples
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
- Plane 3-trees: embeddability and approximation
- Characterizing simultaneous embedding with fixed edges
- Graph stories in small area
- The QuaSEFE problem
- Combining problems on RAC drawings and simultaneous graph drawings
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Visual Analysis of One-to-Many Matched Graphs
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- Planarity-preserving clustering and embedding for large planar graphs
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- Title not available (Why is that?)
This page was built for publication: On simultaneous planar graph embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857060)
