On Extension of Matchings to Hamiltonian Cycles in 6-Cubes

The problem initially raised by Ruskey and Savage: whether every matching in an [Formula: see text]-dimensional hypercube [Formula: see text] with [Formula: see text] can be extended to form a Hamiltonian cycle. Fink addressed Kreweras’ conjecture by proving that all perfect matchings in [Formula: see text] are extendable to Hamiltonian cycles, and also demonstrated that this extension property holds for all matchings when [Formula: see text]. Later, Wang and Zhao expanded the result by showing that every matching in [Formula: see text] can be extended to the Hamiltonian cycle. In this work, we further contribute to this area by proving that every matching consisting of up to 20 edges in the 6-dimensional hypercube [Formula: see text] can be extended to a Hamiltonian cycle.

Authors

Institutions

Publication Details

Journal
Journal of Interconnection Networks
Published
2025-10-04
DOI
https://doi.org/10.1142/s0219265925500227
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On Extension of Matchings to Hamiltonian Cycles in 6-Cubes

Gohar Ali, Weihua Yang, Abid Ali
Journal of Interconnection Networks
Advanced Graph Theory Research
article

On Extension of Matchings to Hamiltonian Cycles in 6-Cubes

Gohar Ali, Weihua Yang, Abid Ali
article en

Abstract

The problem initially raised by Ruskey and Savage: whether every matching in an [Formula: see text]-dimensional hypercube [Formula: see text] with [Formula: see text] can be extended to form a Hamiltonian cycle. Fink addressed Kreweras’ conjecture by proving that all perfect matchings in [Formula: see text] are extendable to Hamiltonian cycles, and also demonstrated that this extension property holds for all matchings when [Formula: see text]. Later, Wang and Zhao expanded the result by showing that every matching in [Formula: see text] can be extended to the Hamiltonian cycle. In this work, we further contribute to this area by proving that every matching consisting of up to 20 edges in the 6-dimensional hypercube [Formula: see text] can be extended to a Hamiltonian cycle.

Journal of Interconnection Networks
Islamia College University (PK), Taiyuan University of Technology (CN)
Openalex Percentile: Top 71%
Advanced Graph Theory Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.