Towards a problem of Ruskey and Savage on matching extendability

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F17%3A10364722" target="_blank" >RIV/00216208:11320/17:10364722 - isvavai.cz</a>
Result on the web
<a href="http://www.sciencedirect.com/science/article/pii/S1571065317301567" target="_blank" >http://www.sciencedirect.com/science/article/pii/S1571065317301567</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.endm.2017.06.071" target="_blank" >10.1016/j.endm.2017.06.071</a>

Result language
angličtina
Original language name
Towards a problem of Ruskey and Savage on matching extendability
Original language description
Does every matching in the n-dimensional hypercube 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 the hypercube of dimension at least two extends to a 2-factor.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA14-10799S" target="_blank" >GA14-10799S: Hybercubic, graph and hypergraph structures</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)