Pages that link to "Item:Q5956107"
From MaRDI portal
The following pages link to Embedding planar graphs at fixed vertex locations (Q5956107):
Displaying 50 items.
- Extending convex partial drawings of graphs (Q334920) (← links)
- Alternating paths and cycles of minimum length (Q340546) (← links)
- Point-set embeddings of plane \(3\)-trees (Q427050) (← links)
- On graph thickness, geometric thickness, and separator theorems (Q621923) (← links)
- Characterizations of restricted pairs of planar graphs allowing simultaneous embedding with fixed edges (Q634247) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Planar straight-line point-set embedding of trees with partial embeddings (Q763547) (← links)
- On triconnected and cubic plane graphs on given point sets (Q833718) (← links)
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Radial drawings of graphs: geometric constraints and trade-offs (Q954965) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Drawing colored graphs on colored points (Q959802) (← links)
- Drawing colored graphs with constrained vertex positions and few bends per edge (Q973017) (← links)
- Untangling a planar graph (Q1042455) (← links)
- Arc diagrams, flip distances, and Hamiltonian triangulations (Q1699291) (← links)
- \(\beta\)-stars or on extending a drawing of a connected subgraph (Q1725776) (← links)
- The paths embedding of the arrangement graphs with prescribed vertices in given position (Q1928512) (← links)
- A center transversal theorem for hyperplanes and applications to graph drawing (Q1942307) (← links)
- On upward point set embeddability (Q1947995) (← links)
- Simultaneous embedding of colored graphs (Q2045370) (← links)
- On inversion-free mapping and distortion minimization (Q2051139) (← links)
- A new algorithm for embedding plane graphs at fixed vertex locations (Q2121749) (← links)
- One-bend drawings of outerplanar graphs inside simple polygons (Q2151442) (← links)
- On compatible triangulations with a minimum number of Steiner points (Q2192383) (← links)
- Colored anchored visibility representations in 2D and 3D space (Q2206717) (← links)
- The QuaSEFE problem (Q2206856) (← links)
- On the curve complexity of 3-colored point-set embeddings (Q2210505) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Planar drawings of fixed-mobile bigraphs (Q2330125) (← links)
- Advancements on SEFE and partitioned book embedding problems (Q2339452) (← links)
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees (Q2396907) (← links)
- Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations (Q2867674) (← links)
- The point-set embeddability problem for plane graphs (Q2875647) (← links)
- Improved algorithms for the point-set embeddability problem for plane 3-trees (Q2905309) (← links)
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- Embedding Plane 3-Trees in ℝ2 and ℝ3 (Q3223942) (← links)
- Upward Point Set Embeddability for Convex Point Sets Is in P (Q3223972) (← links)
- On embedding triconnected cubic graphs on point sets (Q3503515) (← links)
- Embeddability Problems for Upward Planar Digraphs (Q3611856) (← links)
- Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
- Embedding Vertices at Points: Few Bends Suffice for Planar Graphs (Q4540529) (← links)
- Relating Graph Thickness to Planar Layers and Bend Complexity (Q4556953) (← links)
- Colored Point-Set Embeddings of Acyclic Graphs (Q4625132) (← links)
- Quasi-planar Graphs (Q5001655) (← links)
- Right Angle Crossing Drawings of Graphs (Q5001661) (← links)
- Simultaneous Embedding (Q5001665) (← links)
- Extending Partial Orthogonal Drawings (Q5014122) (← links)
- Extending Partial Orthogonal Drawings (Q5084696) (← links)
- (Q5088936) (← links)
