On simultaneous planar graph embeddings
From MaRDI portal
Publication:857060
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
- Drawing graphs. Methods and models
- Drawing the planar dual
- Embedding planar graphs in four pages
- Geometric Thickness of Complete Graphs
- Grid drawings of 4-connected plane graphs
- How to Draw a Graph
- How to draw a planar graph on a grid
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- scientific article; zbMATH DE number 1979531 (Why is no real title available?)
- scientific article; zbMATH DE number 3027510 (Why is no real title available?)
- Maximum independent set and maximum clique algorithms for overlap graphs
- On a Problem of Heilbronn
- On embedding an outer-planar graph in a point set
- Planar graphs and poset dimension
- Representations of Planar Graphs
- The book thickness of a graph
- The geometric thickness of low degree graphs
- The thickness of graphs: A survey
- The Ubiquitous π
Cited in
(81)- Simultaneous embedding of a planar graph and its dual on the grid
- Planarity-preserving clustering and embedding for large planar graphs
- Simultaneous embedding of colored graphs
- 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
- Simultaneous visibility representations of undirected pairs of graphs
- Computing upward topological book embeddings of upward planar digraphs
- Relaxing the constraints of clustered planarity
- Beyond level planarity: cyclic, torus, and simultaneous level planarity
- Compatible spanning trees
- Plane embeddings of planar graph metrics
- Two maps on one surface
- SEFE without mapping via large induced outerplane graphs in plane graphs
- Bounded Embeddings of Graphs in the Plane
- Simultaneous visibility representations of plane \(st\)-graphs using L-shapes
- Simultaneous embeddings with vertices mapping to pre-specified points
- Simultaneous embeddability of two partitions
- Column planarity and partial simultaneous geometric embedding
- Beyond level planarity
- Monotone simultaneous embeddings of paths in d dimensions
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- Simultaneous visibility representations of plane st-graphs using L-shapes
- Orthogeodesic point-set embedding of trees
- On point-sets that support planar graphs
- Combining problems on RAC drawings and simultaneous graph drawings
- Constrained simultaneous and near-simultaneous embeddings
- Crossing number of simultaneous embedding of two planar graphs with restriction
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Simultaneous embedding of embedded planar graphs
- Matched Drawability of Graph Pairs and of Graph Triples
- Colored Simultaneous Geometric Embeddings
- Visual Analysis of One-to-Many Matched Graphs
- Graph Simultaneous Embedding Tool, GraphSET
- scientific article; zbMATH DE number 1979531 (Why is no real title available?)
- scientific article; zbMATH DE number 1500683 (Why is no real title available?)
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Relating graph thickness to planar layers and bend complexity
- Right Angle Crossing Drawings of Graphs
- Beyond Clustered Planar Graphs
- Atomic Embeddability, Clustered Planarity, and Thickenability
- Simultaneous representation of proper and unit interval graphs
- A Note on Universal Point Sets for Planar Graphs
- Graph Stories in Small Area
- Simultaneous embeddings with few bends and crossings
- Plane 3-trees: embeddability and approximation
- Characterizing simultaneous embedding with fixed edges
- Simultaneous Embedding of Planar Graphs with Few Bends
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Column planarity and partially-simultaneous geometric embedding
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- Constrained Simultaneous and Near-Simultaneous Embeddings
- Simultaneous Geometric Graph Embeddings
- Colored simultaneous geometric embeddings and universal pointsets
- Graph Drawing
- Simultaneous Embedding with Two Bends per Edge in Polynomial Area
- On the complexity of some geometric problems with fixed parameters
- Geometric simultaneous embeddings of a graph and a matching
- The Simultaneous Representation Problem for Chordal, Comparability and Permutation Graphs
- Algorithms and Data Structures
- Geometric simultaneous embeddings of a graph and a matching
- An exponential bound for simultaneous embeddings of planar graphs
- Synchronized Planarity with Applications to Constrained Planarity Problems
- Partial and simultaneous transitive orientations via modular decompositions
- Small Point-Sets Supporting Graph Stories
- Small point-sets supporting graph stories
- On graph thickness, geometric thickness, and separator theorems
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- A logarithmic bound for simultaneous embeddings of planar graphs
- A logarithmic bound for simultaneous embeddings of planar graphs
- Geometric thickness of multigraphs is \(\exists \mathbb{R}\)-complete
- Simultaneous representation of proper and unit interval graphs
- On the complexity of simultaneous geometric embedding for edge-disjoint graphs
- Constrained planarity in practice -- engineering the synchronized planarity algorithm
- 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
- Characterization of unlabeled level planar trees
- Matched drawability of graph pairs and of graph triples
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)
