The following publications are possibly variants of this publication:
- Packing Directed Hamilton Cycles OnlineMichael Anastos, Joseph Briggs. siamdm, 32(2):1505-1539, 2018. [doi]
- On packing Hamilton cycles in ?-regular graphsAlan M. Frieze, Michael Krivelevich. JCT, 94(1):159-172, 2005. [doi]
- Optimal Packings of Hamilton Cycles in Sparse Random GraphsMichael Krivelevich, Wojciech Samotij. siamdm, 26(3):964-982, 2012. [doi]
- Packing hamilton cycles in random and pseudo-random hypergraphsAlan M. Frieze, Michael Krivelevich. rsa, 41(1):1-22, 2012. [doi]
- Packing tight Hamilton cycles in 3-uniform hypergraphsAlan M. Frieze, Michael Krivelevich, Po-Shen Loh. rsa, 40(3):269-300, 2012. [doi]
- Packing Tight Hamilton Cycles in Uniform HypergraphsDeepak Bal, Alan M. Frieze. siamdm, 26(2):435-451, 2012. [doi]
- Packing tight Hamilton cycles in 3-uniform hypergraphsAlan M. Frieze, Michael Krivelevich, Po-Shen Loh. soda 2011: 913-932 [doi]
- Counting and packing Hamilton cycles in dense graphs and oriented graphsAsaf Ferber, Michael Krivelevich, Benny Sudakov. JCT, 122:196-220, 2017. [doi]
- On the Resilience of Hamiltonicity and Optimal Packing of Hamilton Cycles in Random GraphsSonny Ben-Shimon, Michael Krivelevich, Benny Sudakov. siamdm, 25(3):1176-1193, 2011. [doi]