Pages that link to "Item:Q5301397"
From MaRDI portal
The following pages link to Planar embeddability of the vertices of a graph using a fixed point set is NP-hard (Q5301397):
Displaying 32 items.
- Point-set embeddings of plane \(3\)-trees (Q427050) (← links)
- Curve-constrained drawings of planar graphs (Q706719) (← links)
- Planar straight-line point-set embedding of trees with partial embeddings (Q763547) (← links)
- Point-set embeddings of trees with given partial drawings (Q924086) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- On upward point set embeddability (Q1947995) (← links)
- Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
- Minimal representations of order types by geometric graphs (Q2206835) (← links)
- A note on universal point sets for planar graphs (Q2206869) (← links)
- Upward point set embeddings of paths and trees (Q2232250) (← links)
- Universal point sets for planar three-trees (Q2253908) (← 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)
- On computational complexity of length embeddability of graphs (Q2629266) (← links)
- The point-set embeddability problem for plane graphs (Q2874563) (← 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)
- Upward Point-Set Embeddability (Q3075525) (← links)
- Embedding Plane 3-Trees in ℝ2 and ℝ3 (Q3223942) (← links)
- Orthogeodesic Point-Set Embedding of Trees (Q3223943) (← links)
- Small Point Sets for Simply-Nested Planar Graphs (Q3223945) (← links)
- Upward Point Set Embeddability for Convex Point Sets Is in P (Q3223972) (← links)
- The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
- Improved Bounds for Drawing Trees on Fixed Points with L-Shaped Edges (Q4625119) (← links)
- A Note on Universal Point Sets for Planar Graphs (Q5119378) (← links)
- Minimal Representations of Order Types by Geometric Graphs (Q5141642) (← 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)
- Deciding whether a grid is a topological subgraph of a planar graph is NP-complete (Q5896079) (← links)
- On 1-bend upward point-set embeddings of \(st\)-digraphs (Q6547912) (← links)
