Pages that link to "Item:Q1862133"
From MaRDI portal
The following pages link to On embedding an outer-planar graph in a point set (Q1862133):
Displaying 41 items.
- Point-set embeddings of plane \(3\)-trees (Q427050) (← links)
- Colored simultaneous geometric embeddings and universal pointsets (Q548667) (← 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)
- On simultaneous planar graph embeddings (Q857060) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Simultaneous graph embedding with bends and circular arcs (Q955231) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- The dual diameter of triangulations (Q1699295) (← links)
- On upward point set embeddability (Q1947995) (← links)
- Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
- Every collinear set in a planar graph is free (Q2022612) (← links)
- Upward point set embeddings of paths and trees (Q2232250) (← links)
- Computing upward topological book embeddings of upward planar digraphs (Q2253904) (← links)
- Universal point sets for planar three-trees (Q2253908) (← links)
- Capacitated domination: problem complexity and approximation algorithms (Q2345937) (← links)
- Orthogeodesic point-set embedding of trees (Q2391540) (← links)
- Optimal point-set embedding of wheel graphs and a sub-class of 3-trees (Q2396907) (← links)
- Plane graphs with parity constraints (Q2441354) (← links)
- SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs (Q2811194) (← 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)
- Drawing Planar Graphs with Many Collinear Vertices (Q2961512) (← links)
- CONSTRAINED POINT-SET EMBEDDABILITY OF PLANAR GRAPHS (Q3063657) (← links)
- Upward Point-Set Embeddability (Q3075525) (← links)
- Plane Graphs with Parity Constraints (Q3183437) (← links)
- Embedding Plane 3-Trees in ℝ2 and ℝ3 (Q3223942) (← links)
- Orthogeodesic Point-Set Embedding of Trees (Q3223943) (← links)
- On Point-Sets That Support Planar Graphs (Q3223944) (← links)
- Small Point Sets for Simply-Nested Planar Graphs (Q3223945) (← links)
- Upward Point Set Embeddability for Convex Point Sets Is in P (Q3223972) (← links)
- On embedding triconnected cubic graphs on point sets (Q3503515) (← links)
- Constrained Point-Set Embeddability of Planar Graphs (Q3611871) (← links)
- Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges (Q4625119) (← links)
- -shaped point set embeddings of high-degree plane graphs (Q5154585) (← links)
- Geometry and Generation of a New Graph Planarity Game (Q5233138) (← links)
- Plane 3-Trees: Embeddability and Approximation (Q5251619) (← links)
- Constrained Point Set Embedding of a Balanced Binary Tree (Q5261607) (← links)
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets (Q5302049) (← links)
- Computing Upward Topological Book Embeddings of Upward Planar Digraphs (Q5387755) (← links)
