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?
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.