Graph TheoryChallengePlanar Graphs
Planar Graphs · Challenge problem
A convex polyhedron is -regular (every vertex meets exactly edges), and every face is either a pentagon or a hexagon. It has exactly faces total, with edges meeting at every vertex. How many of the faces are pentagons?