Graph TheorySuperchallengePlanar Graphs
Planar Graphs · Superchallenge problem
A connected simple plane graph is self-dual (), and every face is a triangle or a quadrilateral, with exactly twice as many triangular faces as quadrilateral ones. Find .
A connected simple plane graph is self-dual (), and every face is a triangle or a quadrilateral, with exactly twice as many triangular faces as quadrilateral ones. Find .