Graph TheorySuperchallengePlanar Graphs
Planar Graphs · Superchallenge problem
A connected plane graph is self-dual (isomorphic to its own dual) and has exactly edges. How many vertices does it have?
A connected plane graph is self-dual (isomorphic to its own dual) and has exactly edges. How many vertices does it have?