Counting Hamilton decompositions of oriented graphs
<p>A Hamilton cycle in a directed graph G is a cycle that passes through every vertex of G. A Hamilton decomposition of G is a partition of its edge set into disjoint Hamilton cycles. In the late 60s Kelly conjectured that every regular tournament has a Hamilton decomposition. This conjecture...
| Main Authors: | , , |
|---|---|
| Format: | Journal article |
| Published: |
Oxford University Press
2017
|