Anastos M. 2023. Constructing Hamilton cycles and perfect matchings efficiently. Proceedings of the 12th European Conference on Combinatorics, Graph Theory and Applications. EUROCOMB: European Conference on Combinatorics, Graph Theory and Applications, 36–41.