We define a Markov chain on the set of Euler tours of a given Eulerian grap
h based on transformations first defined by Kotzig in 1966. We prove that t
he chain is rapidly mixing if the maximum degree in the given graph is 6, t
hus obtaining an efficient algorithm for sampling and counting the set of E
uler tours for such an Eulerian graph.