Name
Abstract | ||
|---|---|---|
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). |
Year | DOI | Venue |
|---|---|---|
2018 | 10.7151/dmgt.2010 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
hypercube,Hamiltonian cycle,matching | Discrete mathematics,Combinatorics,Hamiltonian (quantum mechanics),Hamiltonian path,Mathematics,Hypercube,5-cube | Journal |
Volume | Issue | ISSN |
38 | 1 | 1234-3099 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| fan wang | 1 | 34 | 18.08 |
| Weisheng Zhao | 2 | 2 | 1.75 |