Simultaneous embeddings with few bends and crossings

DOI10.7155/JGAA.00507zbMATH Open1419.05146OpenAlexW2973145124MaRDI QIDQ5233141FDOQ5233141

Authors:

Publication date: 16 September 2019

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

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

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

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)

Cites Work

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

Cited In (7)

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

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)