## Homework Set VII and Problem Set G (2/27)

Read Section 3.1.

Do for discussion Wed. March 10:

Sect. 3.1, ## 1-3, 4 (for I, D, K_{4,4} only), 7, 8, 11, 14.

## G1(a), G2(a), G3.

Hand in Mon. March 15:

Sect. 3.1, ## 1 (for O), 5, 6, 12, 13, 15, 16.

## G1(b, c), G2(b, c), G3(b).

Go to announcements | course information | homework list | previous homework | next homework.

See the corrections for Section 3.1.

## Problem Set G

G1. Decompose into the fewest possible *trails*:

(a) Fig. 1.2.3 (left).

(b) Fig. 2.1.9.

(c) Fig. 2.2.6 (right).

G2. Decompose into the fewest possible *paths*: (a, b, c) as in #G1.

G3. Decide whether the graph is Hamiltonian:

(a) Fig. 2.1.3.

(b) Fig. 2.1.6.