Combinatorial isomorphisms of 2-connected plane graphs are topological

19 Views Asked by At

In Diestel Theorem 4.3.1 (ii) it says "Every combinatorial isomorphism between two 2-connected plane graphs is topological."

I don't understand, where in the proof do we use the fact that the graphs are 2-connected?

1 2 3