Guest Session: 1 Question Remaining. Create Account to save progress.
Login
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 444 edges. If the graph has 101010 vertices, how many edges does it have?