Graph TheoryHardPlanar Graphs
Planar Graphs · Hard problem
A connected plane graph is a triangulation (every face, including the outer one, is a triangle) with vertices. How many vertices does its DUAL graph have?
A connected plane graph is a triangulation (every face, including the outer one, is a triangle) with vertices. How many vertices does its DUAL graph have?