Drexel dragonThe Math ForumDonate to the Math Forum



Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.


Math Forum » Discussions » sci.math.* » sci.math.independent

Topic: Graph
Replies: 3   Last Post: Dec 19, 2012 4:40 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]
Ken.Pledger@vuw.ac.nz

Posts: 1,374
Registered: 12/3/04
Re: Graph
Posted: Dec 18, 2012 5:12 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In article <5d700382-9617-4a00-b88f-9881a0073257@googlegroups.com>,
Sonia <slopezbardo@gmail.com> wrote:

> A planar graph, simple, G with no vertex of degree one or two have a vertex
> of degree 3, 4 or 5
>
> Do you know how to show, or what book I can find something?


If you have been reading about planar graphs, you have probably seen
that if a connected simple planar graph has v vertices and e edges,
then e <= 3v - 6.

Now suppose your statement is false, i.e. every vertex has degree at
least 6. What follows?

Ken Pledger.


Date Subject Author
12/18/12
Read Graph
Sonia
12/18/12
Read Re: Graph
Ken.Pledger@vuw.ac.nz
12/19/12
Read Re: Graph
William Elliot
12/19/12
Read Re: Graph
trj

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2014. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.