Simultaneous Embedding of Planar Graphs with Few Bends
From MaRDI portal
Publication:5301376
Recommendations
- Graph Drawing
- Simultaneous embedding of embedded planar graphs
- Simultaneous embedding of embedded planar graphs
- scientific article; zbMATH DE number 1500681
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- On simultaneous planar graph embeddings
- Simultaneous embeddings with few bends and crossings
- Simultaneous embeddings with few bends and crossings
- An exponential bound for simultaneous embeddings of planar graphs
- Algorithms and Data Structures
Cited in
(39)- Two trees which are self-intersecting when drawn simultaneously
- Shortest path embeddings of graphs on surfaces
- Simultaneous embedding of colored graphs
- Computing upward topological book embeddings of upward planar digraphs
- Relaxing the constraints of clustered planarity
- On embedding a graph in the grid with the maximum number of bends and other bad features
- Advancements on SEFE and partitioned book embedding problems
- Simultaneous embeddings with vertices mapping to pre-specified points
- Drawing simultaneously embedded graphs with few bends
- Column planarity and partial simultaneous geometric embedding
- Simultaneous embeddings with few bends and crossings
- Monotone simultaneous embeddings of paths in d dimensions
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected graph or a tree
- On a tree and a path with no geometric simultaneous embedding
- On a tree and a path with no geometric simultaneous embedding
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
- Simultaneous embedding of embedded planar graphs
- Simultaneous Graph Embedding with Bends and Circular Arcs
- Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
- Relating graph thickness to planar layers and bend complexity
- Right Angle Crossing Drawings of Graphs
- Beyond Clustered Planar Graphs
- Simultaneous embeddings with few bends and crossings
- Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs
- Colored simultaneous geometric embeddings and universal pointsets
- Graph Drawing
- Simultaneous Embedding with Two Bends per Edge in Polynomial Area
- Graph Drawing
- Algorithms and Data Structures
- Drawing Simultaneously Embedded Graphs with Few Bends
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges
- Parameterized complexity of simultaneous planarity
- Thickness and colorability of geometric graphs
- Structural parameterizations of simultaneous planarity
- On simultaneous planar graph embeddings
- Simultaneous graph embedding with bends and circular arcs
- Matched drawability of graph pairs and of graph triples
This page was built for publication: Simultaneous Embedding of Planar Graphs with Few Bends
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301376)
