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?
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?
Copyright © 2021 JogjaFile Inc.


