Graph TheoryChallengePlanar Graphs
Planar Graphs · Challenge problem
A connected plane graph has vertices and no triangles. What is the largest number of faces it can have?
A connected plane graph has vertices and no triangles. What is the largest number of faces it can have?