MTH210	Tutorial 5
	Introduction to Graph Theory

Readings

1. p. 663 #17, 20, 26

2. p. 664 #40, 42

3. p 680 #4, 6c, 7, 8c

4. p. 681 #15, 20

5. p. 681 #24, 31

6. Note that this question is an expansion of p. 683 #47 and 48.
   For what values of n (and m where appropriate) do the following graphs have:
   1. An Eulerian Circuit
   2. A Hamiltonian Circuit.
   Explain your answers.
   1. The complete graph K_n.
   2. The complete bipartite graph K_m,n.
   3. The circuit C_n.
   4. The simple path P_n.
   5. A diconnected graph with n edges.