Simultaneous embeddings with few bends and crossings

DOI10.7155/JGAA.00507MaRDI QIDQ5233141zbMATH OpenOpenAlexFDO

Authors

Publication date 16 September 2019

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00507

zbMATH Keywords

simultaneous embedding with fixed edges

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Recommendations

• Simultaneous embeddings with few bends and crossings
• Drawing simultaneously embedded graphs with few bends
• Simultaneous Embedding of Planar Graphs with Few Bends
• Graph Drawing
• Simultaneous Embedding with Two Bends per Edge in Polynomial Area

Cites work

• 1-page and 2-page drawings with bounded number of crossings per edge
• Algorithms for plane representations of acyclic digraphs
• An algorithm for constructing star-shaped drawings of plane graphs
• An SPQR-Tree Approach to Decide Special Cases of Simultaneous Embedding with Fixed Edges
• Constrained simultaneous and near-simultaneous embeddings
• Crossing-Free Subgraphs
• Curve-constrained drawings of planar graphs
• Disconnectivity and relative positions in simultaneous embeddings
• Drawing partially embedded and simultaneously planar graphs
• Drawing simultaneously embedded graphs with few bends
• Embedding Graphs Simultaneously with Fixed Edges
• Embedding Vertices at Points: Few Bends Suffice for Planar Graphs
• Embedding planar graphs at fixed vertex locations
• Geometric drawings of \(K_{n}\) with few crossings
• Graphs drawn with few crossings per edge
• On Embedding a Graph in the Grid with the Minimum Number of Bends
• On a tree and a path with no geometric simultaneous embedding
• On simultaneous planar graph embeddings
• On the Number of Crossings in a Complete Graph
• On the computational complexity of upward and rectilinear planarity testing
• SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES
• Simultaneous Embedding of Planar Graphs with Few Bends
• Simultaneous Embedding with Two Bends per Edge in Polynomial Area
• Simultaneous Geometric Graph Embeddings
• Simultaneous Graph Drawing: Layout Algorithms and Visualization Schemes
• Simultaneous drawing of planar graphs with right-angle crossings and few bends
• Simultaneous embeddings with few bends and crossings
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Two trees which are self-intersecting when drawn simultaneously

Cited in

(7)

• Simultaneous Embedding of Planar Graphs with Few Bends
• Drawing simultaneously embedded graphs with few bends
• Simultaneous embeddings with few bends and crossings
• Drawing Simultaneously Embedded Graphs with Few Bends
• Hanani--Tutte and Hierarchical Partial Planarity
• Simultaneous Embedding
• Crossing number of simultaneous embedding of two planar graphs with restriction

This page was built for publication: Simultaneous embeddings with few bends and crossings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233141)