Math 316/416

Reading Questions

Read Section 2.2

1. What do Hamilton circuits have to do with determining whether graphs are isomorphic?
2. Can a graph have a Hamilton circuit and not an Euler cycle? What about vice-versa? Both? Neither? Illustrate with examples.
3. How many Hamilton circuits does K₉ have? Explain.
4. Which complete bipartite graphs K_{n, m} have Hamilton circuit? Explain.
5. What are some ways to show that a graph does not have a Hamilton circuit?

Exercises: 2.2: 2, 3, 5, 6, 9, 11 (M416: 12, 16)