![]() |
|
![]() |
Introduction: In this section, we move from the simple theory of Euler cylces to the more complicated Hamilton circuits. We now find ourselves in the more normal (for graph theory!) situation where we must apply complicated ad hoc arguments rather than an organized theory to accomplish our goals..
| Gray code Hamilton Circuit |
Hamilton Path Tournament |
1. The basic rules to be applied in finding a Hamilton circuit are found on p. 57. These are very important and you should make sure you understand the reasons behind them.
2. Follow through the examples to make sure you understand why each step is in them.
3. Most of the Theorems are not proved in the text, but we will still make use of them. Theorems 2 and 3 especially will require some extra thought to enable you to know what they are saying. We will try to prove at least one of these theorems in class.