MathCastle
Graph TheorySuperchallengePlanar Graphs

Planar Graphs · Superchallenge problem

The dual G∗G^* of a connected simple bipartite planar graph GG has 2424 edges. If GG achieves equality in the bipartite edge bound E≤2V−4E \le 2V-4, find VV.