Study Guide 
Tucker: Applied Combinatorics 
§2.2 Hamilton Circuits
Dr. Lee Eimers
Revised 10-4-07

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.. 


Concepts and Vocabulary:
The following boldfaced (or italic) terms and phrases introduced in this section.
 
Gray code
Hamilton Circuit
Hamilton Path
Tournament
Points of Interest:

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.


 Homework Assignment:

Required Reading:
Chapter 2, Section 2 of text
Look up vocabulary terms above in Bondy and Murty and Diestel, and read relevant sections

 Do to hand in: #2, 4[a,c,e,j only. Do them all by applying the rules (p. 57) and then apply Theorem 3 to do parts a and b a second time], 8c, 9, 14, 15, 19, 20
            Enrichment problems: Anything from #10 on.

 Thought for the Day
The way of the slothful man is like a hedge of thorns,
But the way of the upright is a highway.
Prov 15:19, NKJV