Perfect matchings extend to Hamilton cycles in hypercubes

@article{Fink2007PerfectME,
  title={Perfect matchings extend to Hamilton cycles in hypercubes},
  author={Jir{\'i} Fink},
  journal={J. Comb. Theory, Ser. B},
  year={2007},
  volume={97},
  pages={1074-1076}
}
Kreweras’ conjecture [1] asserts that any perfect matching of the hypercube Qd, d ≥ 2, can be extended to a Hamilton cycle. We prove this conjecture. 

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

Combining SAT Solvers with Computer Algebra Systems to Verify Combinatorial Conjectures

Journal of Automated Reasoning • 2016
View 5 Excerpts
Highly Influenced

Extending a perfect matching to a Hamiltonian cycle

Discrete Mathematics & Theoretical Computer Science • 2015
View 5 Excerpts
Highly Influenced

Large Graphs in Advanced Applications

View 2 Excerpts
Highly Influenced

Gray Codes Avoiding Matchings

Discrete Mathematics & Theoretical Computer Science • 2009
View 3 Excerpts
Highly Influenced

Matchings of quadratic size extend to long cycles in hypercubes

Discrete Mathematics & Theoretical Computer Science • 2016
View 2 Excerpts

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Matchings and Hamiltonian cycles on hypercubes

G. Kreweras
Bull. Inst. Combin. Appl • 1996
View 3 Excerpts
Highly Influenced

Dvořák : Hamiltonian cycles with prescribed edges in hypercubes

R. D. Dimitrov
SIAM J . Discrete Math . • 2005

A survey of combinatorial Gray codes

C. Savage
SIAM Rev • 1997

Savage : A survey of combinatorial Gray codes

T.
SIAM Rev . • 1997

Kreweras : Matchings and Hamiltonian cycles on hypercubes

G.
Bull . Inst . Combin . Appl . • 1996

Kreweras : Matchings and Hamiltonian cycles on hypercubes , Bull

G.
Inst . Combin . Appl . • 1996

Similar Papers

Loading similar papers…