Name
Abstract | ||
|---|---|---|
Does every matching in the n-dimensional hypercube Qn extend to a Hamiltonian cycle? This question was raised by Ruskey and Savage in 1993 and even though a positive answer in known in some special cases, the problem still remains open in general. In this paper we present recent results on extendability of matchings in hypercubes to Hamiltonian cycles and paths as well as on the computational complexity of these problems, motivated by the Ruskey-Savage question. Moreover, we verify the conjecture of Vandenbussche and West saying that every matching in Qn, n≥2, extends to a 2-factor. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1016/j.endm.2017.06.071 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Hamiltonian cycle,hypercube,matching,Ruskey and Savage problem | Discrete mathematics,Combinatorics,Hamiltonian (quantum mechanics),Hamiltonian path,Conjecture,Hypercube,Mathematics,Computational complexity theory | Journal |
Volume | ISSN | Citations |
61 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 8 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jiří Fink | 1 | 82 | 9.00 |
| Tomáš Dvořák | 2 | 130 | 10.21 |
| Petr Gregor | 3 | 178 | 19.79 |
| Tomás Novotný | 4 | 0 | 1.01 |