Theorem: cycle graph C_N Euler characteristic V - E + F = N - N + 2 = 2

Theorem (cycle Euler-characteristic canonical): for a cycle graph C_N embedded in the plane with V = N vertices, E = N edges (the N cycle bonds), and F = 2 faces (one inside the cycle + the outer unbounded face), the Euler characteristic V…