, Volume 30, Issue 3, pp 376-385

Random Sampling of Euler Tours

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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.