Graph TheorySuperchallengePlanar Graphs
Planar Graphs · Superchallenge problem
A planar graph has every vertex of degree at least . What is the smallest number of vertices it can have?
A planar graph has every vertex of degree at least . What is the smallest number of vertices it can have?