Pages that link to "Item:Q834906"
From MaRDI portal
The following pages link to A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906):
Displaying 13 items.
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
- Upward straight-line embeddings of directed graphs into point sets (Q1037786) (← links)
- Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
- Every collinear set in a planar graph is free (Q2022612) (← links)
- A note on universal point sets for planar graphs (Q2206869) (← links)
- Universal point sets for planar three-trees (Q2253908) (← 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)
- A Note on Universal Point Sets for Planar Graphs (Q5119378) (← links)
- Plane 3-Trees: Embeddability and Approximation (Q5251619) (← links)
- Upward Straight-Line Embeddings of Directed Graphs into Point Sets (Q5302049) (← links)
- An exponential bound for simultaneous embeddings of planar graphs (Q6063275) (← links)
