Drawing Simultaneously Embedded Graphs with Few Bends

DOI10.1142/S0129054123420017MaRDI QIDQ6066464zbMATH OpenFDO

Authors Luca Grilli, Seok-Hee Hong, Jan Kratochvíl, Ignaz Rutter

Publication date 16 November 2023

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054123420017

zbMATH Keywords

graph drawingsimultaneous embedding with few bendssimultaneous embedding with fixed edgessimultaneous geometric embedding

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Drawing simultaneously embedded graphs with few bends
• Drawing partially embedded and simultaneously planar graphs
• Drawing partially embedded and simultaneously planar graphs
• Simultaneous drawing of planar graphs with right-angle crossings and few bends
• Simultaneous drawing of planar graphs with right-angle crossings and few bends
• Graph Drawing
• Simultaneous Embedding of Planar Graphs with Few Bends
• Simultaneous Graph Embedding with Bends and Circular Arcs
• Simultaneous graph embedding with bends and circular arcs
• Drawing Colored Graphs with Constrained Vertex Positions and Few Bends per Edge

Cites work

• A Kuratowski-type theorem for planarity of partially embedded graphs
• Atomic Embeddability, Clustered Planarity, and Thickenability
• Convex drawings of graphs with non-convex boundary constraints
• Drawing partially embedded and simultaneously planar graphs
• Drawing planar graphs with a prescribed inner face
• Drawing simultaneously embedded graphs with few bends
• Embedding planar graphs at fixed vertex locations
• How to Draw a Graph
• Intersection Graphs in Simultaneous Embedding with Fixed Edges
• On a tree and a path with no geometric simultaneous embedding
• ON EXTENDING A PARTIAL STRAIGHT-LINE DRAWING
• Simultaneous Embedding
• Simultaneous Embedding of Planar Graphs with Few Bends
• Simultaneous embeddings with few bends and crossings
• Simultaneous Geometric Graph Embeddings
• Simultaneous Graph Embeddings with Fixed Edges
• Simultaneous PQ-ordering with applications to constrained embedding problems
• String graphs requiring exponential representations
• Synchronized planarity with applications to constrained planarity problems
• Testing planarity of partially embedded graphs
• Testing simultaneous planarity when the common graph is 2-connected
• Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
• Toward a theory of planarity: Hanani-Tutte and planarity variants

This page was built for publication: Drawing Simultaneously Embedded Graphs with Few Bends

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