This preview shows page 1. Sign up to view the full content.
Unformatted text preview: List all cycles. What is the longest path this graph has as a subgraph? What is the longest path this graph has as an induced subgraph? 2. Prove that any graph with n vertices and e edges has a vertex of degree at most 2 e n . 3. Chapter 11.1, exercises 5, 6, 7. 4. Chapter 11.2, exercises 6, 9, 11, 14....
View
Full
Document
This note was uploaded on 07/15/2010 for the course MACM 201 taught by Professor Marnimishna during the Spring '09 term at Simon Fraser.
 Spring '09
 MarniMishna

Click to edit the document details