| Article ID: | iaor20023713 |
| Country: | United States |
| Volume: | 30 |
| Issue: | 3 |
| Start Page Number: | 376 |
| End Page Number: | 385 |
| Publication Date: | Jul 2001 |
| Journal: | Algorithmica |
| Authors: | Tetali P., Vempala S. |
We define a Markov chain on the set of Euler tours of a given Eulerian graph based on transformations first defined by Kotzig in 1966. We prove that the chain is rapidly mixing if the maximum degree in the given graph is 6, thus obtaining an efficient algorithm for sampling and counting the set of Euler tours for such an Eulerian graph.