Pages that link to "Item:Q5119378"
From MaRDI portal
The following pages link to A Note on Universal Point Sets for Planar Graphs (Q5119378):
Displaying 15 items.
- A 1.235 lower bound on the number of points needed to draw alln-vertex planar graphs (Q834906) (← links)
- Universal sets of \(n\) points for one-bend drawings of planar graphs with \(n\) vertices (Q848671) (← links)
- On universal graphs for planar oriented graphs of a given girth (Q1584330) (← links)
- Universal point sets for planar three-trees (Q2253908) (← links)
- A universality theorem for stressable graphs in the plane (Q4988843) (← links)
- Topological Drawings Meet Classical Theorems from Convex Geometry (Q5014123) (← links)
- Proximity in triangulations and quadrangulations (Q5054040) (← links)
- Universal Point Sets for Drawing Planar Graphs with Circular Arcs (Q5419482) (← links)
- On Universal Point Sets for Planar Graphs (Q5891332) (← links)
- On Universal Point Sets for Planar Graphs (Q5895226) (← links)
- An exponential bound for simultaneous embeddings of planar graphs (Q6063275) (← links)
- Coloring circle arrangements: new 4-chromatic planar graphs (Q6612515) (← links)
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024 (Q6613406) (← links)
- A logarithmic bound for simultaneous embeddings of planar graphs (Q6618255) (← links)
- Universal geometric graphs (Q6632774) (← links)
