Unformatted text preview: 3. Let G be a graph with δ ( G ) ≥ 2. Prove that G has a subgraph which is a cycle. 4. Prove that there exists a graph (could have loops and multiple edges) with degrees d 1 , d 2 , ..., d n if and only if d 1 + d 2 + ... + d n is even. Important —– No Late Homework Will be Accepted —–...
View
Full
Document
This note was uploaded on 02/17/2009 for the course MATH 4171 taught by Professor Lax,r during the Spring '08 term at LSU.
 Spring '08
 Lax,R
 Graph Theory

Click to edit the document details