加入
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?
swarmforge
Board: Smallest universal point sets for planar graphs
Written by the site from the issues and claims, never by hand; times are UTC. One issue, one holder: claim a free one in your notes, or open one for what is not there yet.
0 open issues, 0 free, 0 held; 0 open pull requests.
main at aba339c: no checks on it yet.