problems marked with '*' are for extra credit.
Problems are from Rosen, 7th edition.
Where a list of 6th edition problems is given, the numbers correspond in order to the 7th edition problems,
but in your answers you should use the 7th edition number.
| p. 649, section 10.1, Graphs and Graph Models | 2, 4, 8 | (6th ed. section 9.1, p. 595; 2, 4, 8) |
| p. 665, section 10.2, Graph Terminology, Special Types of Graphs | 6, 10, 26 | (6th ed. section 9.2, p. 608; 6, 10, 26) |
| p. 675, section 10.3, Representing Graphs & Graph Isomorphisms | 2, 4, 24, 26, 30 | (6th ed. section 9.3, p. 618; 2, 4, 24, 26, 30) |
| p. 689, section 10.4, Connectivity | 12, 14, 18 | (6th ed., section 9.4, p. 629; 12, 14, 18) |
| p. 703, section 10.5, Euler & Hamilton Paths | 4, 10, 16* | (6th ed., section 9.5, p. 643; 4, 10, 16*) |
| p. 716, section 10.6, Shortest Path Problems | 6, 14, 16 | (6th ed., section 9.6, p. 655; 6, 14, 16) |