MathCastle
Graph TheoryHardPlanar Graphs

Planar Graphs · Hard problem

One edge of K5K_5 is subdivided twice, so it becomes a path through 22 new vertices. How many edges does the new graph have?