MATCHINGS EXTEND TO HAMILTONIAN CYCLES IN 5-CUBE

作者:Wang, Fan*; Zhao, Weisheng
来源:Discussiones Mathematicae - Graph Theory, 2018, 38(1): 217-231.
DOI:10.7151/dmgt.2010

摘要

Ruskey and Savage asked the following question: Does every matching in a hypercube Q(n) for n >= 2 extend to a Hamiltonian cycle of Q(n)? Fink confirmed that every perfect matching can be extended to a Hamiltonian cycle of Q(n), thus solved Kreweras' conjecture. Also, Fink pointed out that every matching can be extended to a Hamiltonian cycle of Q(n) for n epsilon {2, 3, 4}. In this paper, we prove that every matching in Q(5) can be extended to a Hamiltonian cycle of Q(5).