MathCastle
Graph TheoryHardPlanar Graphs

Planar Graphs · Hard problem

A connected simple planar bipartite graph is 33-regular (every vertex has degree 33), and every face in its plane drawing is a quadrilateral (achieving the bipartite edge bound E=2V−4E=2V-4 with equality). How many edges does it have?