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 » Math Topics » discretemath

Topic: Graph theory
Replies: 1   Last Post: Jul 7, 2009 9:06 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 2
Registered: 6/4/06
Graph theory
Posted: Jun 4, 2006 1:32 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply


Let G be a simple connected cubic plane graph, and let phi_k be the number of
k-sided faces. By counting the number of vertices and edges of G, prove that:

3*phi_3 + 2*phi_4 + phi_5 - phi_7 - 2*phi_8 - . . . = 12


Deduce that G has at least one face bounded by at most five edges

Date Subject Author
Read Graph theory
Read Re: Graph theory

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

[Privacy Policy] [Terms of Use]

© The Math Forum 1994-2015. All Rights Reserved.