Pages that link to "Item:Q706719"
From MaRDI portal
The following pages link to Curve-constrained drawings of planar graphs (Q706719):
Displaying 37 items.
- Area, curve complexity, and crossing resolution of non-planar graph drawings (Q649108) (← links)
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
- Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- Simultaneous embedding of colored graphs (Q2045370) (← links)
- Limitations on realistic hyperbolic graph drawing (Q2151459) (← links)
- On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Polyline drawings with topological constraints (Q2290634) (← links)
- Obedient plane drawings for disk intersection graphs (Q2405279) (← links)
- \(k\)-spine, 1-bend planarity (Q2503294) (← links)
- Trade-Offs in Planar Polyline Drawings (Q2936936) (← links)
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- On Point-Sets That Support Planar Graphs (Q3223944) (← links)
- Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way (Q3378507) (← links)
- SIMULTANEOUS EMBEDDING OF OUTERPLANAR GRAPHS, PATHS, AND CYCLES (Q3442763) (← links)
- Drawing Bipartite Graphs on Two Curves (Q3595484) (← links)
- Crossing-Optimal Acyclic Hamiltonian Path Completion and Its Application to Upward Topological Book Embeddings (Q3605502) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
- On embedding curves in two-dimensional polyhedra (Q3732560) (← links)
- Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← links)
- Windrose Planarity: Embedding Graphs with Direction-Constrained Edges (Q4575650) (← links)
- Upward Book Embeddings of st-Graphs (Q5088940) (← links)
- Simultaneous Embeddings with Few Bends and Crossings (Q5233141) (← links)
- Plane 3-Trees: Embeddability and Approximation (Q5251619) (← links)
- Drawing Bipartite Graphs on Two Parallel Convex Curves (Q5301430) (← links)
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs (Q5387755) (← links)
- Drawing HV-Restricted Planar Graphs (Q5405036) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5902521) (← links)
- 2-colored point-set embeddings of partial 2-trees (Q5925531) (← links)
- Upward book embeddability of \(st\)-graphs: complexity and algorithms (Q6066758) (← links)
- 2-Layer Graph Drawings with Bounded Pathwidth (Q6181954) (← links)
- A positive fraction Erdős-Szekeres theorem and its applications (Q6186490) (← links)
- Universal geometric graphs (Q6632774) (← links)
