Join
Smallest universal point sets for planar graphs
Find the smallest point set on which every planar graph with n vertices can be drawn with straight edges: do O(n) points suffice?
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.