Results 1 to 1 of 1

Thread: the graph of any triangulation will have at least two vertices of degree 2?

  1. October 5th 2009, 05:54 PM #1
    pbplaya89
    pbplaya89 is offline
    Newbie
    Joined
    Oct 2009
    Posts
    1

    the graph of any triangulation will have at least two vertices of degree 2?

    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+
« Proving a function is one-to-one/onto | Arranging objects with restrictions »

Similar Math Help Forum Discussions

  1. Graph Theory: Relationship between maximum degree of a graph and maximal matching
    Posted in the Advanced Math Topics Forum
    Replies: 0
    Last Post: September 25th 2010, 05:59 AM
  2. Vertices pairwise in grid graph
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: December 13th 2009, 07:41 AM
  3. Coloring Vertices in Graph Theory
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 29th 2009, 06:04 AM
  4. how many vertices does this graph have.....
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: October 27th 2008, 06:30 PM
  5. Vertices of a simple graph
    Posted in the Discrete Math Forum
    Replies: 6
    Last Post: June 8th 2007, 03:37 PM

Search Tags


/mathhelpforum @mathhelpforum