3
$\begingroup$

I have this problem. I have to show that every plane graph is combinatorially isomorphic to a plane graph whose edges are all straight. I Also have an hint that says to give a plane triangulation and construct inductively a graph theoretically isomorphic with all edges straight. Can some one give me an idea or sketch of the proof. Thank you.

1 Answers 1

0

This is Fary's Theorem and here is the proof