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.
Tell me more
×
Mathematics Stack Exchange is a question and answer site for
people studying math at any level and professionals in related fields. It's 100% free, no registration required.
|
|
