Matchings Extend to Hamiltonian Cycles in 5-Cube

Fan Wang, and Weisheng Zhao. "Matchings Extend to Hamiltonian Cycles in 5-Cube." Discussiones Mathematicae Graph Theory 38.1 (2018): 217-231. <http://eudml.org/doc/288556>.

@article{FanWang2018,
abstract = {Ruskey and Savage asked the following question: Does every matching in a hypercube Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? Fink confirmed that every perfect matching can be extended to a Hamiltonian cycle of Qn, thus solved Kreweras’ conjecture. Also, Fink pointed out that every matching can be extended to a Hamiltonian cycle of Qn for n ∈ \{2, 3, 4\}. In this paper, we prove that every matching in Q5 can be extended to a Hamiltonian cycle of Q5.},
author = {Fan Wang, Weisheng Zhao},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {hypercube; Hamiltonian cycle; matching},
language = {eng},
number = {1},
pages = {217-231},
title = {Matchings Extend to Hamiltonian Cycles in 5-Cube},
url = {http://eudml.org/doc/288556},
volume = {38},
year = {2018},
}

TY - JOUR
AU - Fan Wang
AU - Weisheng Zhao
TI - Matchings Extend to Hamiltonian Cycles in 5-Cube
JO - Discussiones Mathematicae Graph Theory
PY - 2018
VL - 38
IS - 1
SP - 217
EP - 231
AB - Ruskey and Savage asked the following question: Does every matching in a hypercube Qn for n ≥ 2 extend to a Hamiltonian cycle of Qn? Fink confirmed that every perfect matching can be extended to a Hamiltonian cycle of Qn, thus solved Kreweras’ conjecture. Also, Fink pointed out that every matching can be extended to a Hamiltonian cycle of Qn for n ∈ {2, 3, 4}. In this paper, we prove that every matching in Q5 can be extended to a Hamiltonian cycle of Q5.
LA - eng
KW - hypercube; Hamiltonian cycle; matching
UR - http://eudml.org/doc/288556
ER -