I am having trouble figuring out this problem for my homework and understanding why this is true:
Prove by induction that the graph of any triangulation of a polygon will have at least two vertices of degree 2.
Please help me ASAP, thanks.
I am having trouble figuring out this problem for my homework and understanding why this is true:
Prove by induction that the graph of any triangulation of a polygon will have at least two vertices of degree 2.
Please help me ASAP, thanks.