Graph Theorymedium
0:00.0
A connected planar graph is drawn in the plane such that every face (including the outer unbounded face) is bounded by exactly edges. If the graph has vertices, how many edges does it have?
A connected planar graph is drawn in the plane such that every face (including the outer unbounded face) is bounded by exactly edges. If the graph has vertices, how many edges does it have?