This preview shows page 1. Sign up to view the full content.
Unformatted text preview: vertices, indicating a Euler path, start at one of the odd vertices; if it has no odd vertices, indicating a Euler circuit, start at any vertex.  Number the edges as you trace through the graph according to the following rules: [a] After you have traveled over an edge, erase it and substitute a dashed line; [b] Travel over an edge that is a bridge only when there is no alternative. See pages 796 – 800 (4 th ed.) or 837 – 840 (5 th ed.) for the following problems: 1. Problem 6: 2. [a] Problem 8 [b] Problem 10 [c] Problem 12 3. Problem 20 4. Problem 26 5. Problems 30 6. a. Problem 42 b. Problem 44 7. Problem 48:...
View Full Document
This note was uploaded on 01/04/2012 for the course MGF 1107 taught by Professor Patriciabishop during the Fall '11 term at Miami Dade College, Miami.
- Fall '11