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.
Last edited by mr fantastic; October 5th 2009 at 06:00 PM.
Reason: Changed post title
Follow Math Help Forum on Facebook and Google+
View Tag Cloud