Perfect matchings extend to Hamilton cycles in hypercubes

被引:62
作者
Fink, Jiri [1 ]
机构
[1] Charles Univ Prague, Fac Math & Phys, Dept Appl Math, George Town 11800, Malaysia
关键词
hypercube; Hamiltonian cycle; perfect matching;
D O I
10.1016/j.jctb.2007.02.007
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Kreweras' conjecture [G. Kreweras, Matchings and Hamiltonian cycles on hypercubes, Bull. Inst. Combin. Appl. 16 (1996) 87-91] asserts that any perfect matching of the hypercube Q(d), d >= 2, can be extended to a Hamilton cycle. We prove this conjecture. (C) 2007 Elsevier Inc. All rights reserved.
引用
收藏
页码:1074 / 1076
页数:3
相关论文
共 6 条
[1]  
DIMITROV D, UNPUB GRAY CODES FAU
[2]   Hamiltonian cycles with prescribed edges in hypercubes [J].
Dvorák, T .
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2005, 19 (01) :135-144
[3]  
Gros Louis A., 1872, THEORIE BAGUENODIER
[4]  
Kreweras G., 1996, B I COMBIN APPL, V16, P87
[5]   A survey of combinational Gray codes [J].
Savage, C .
SIAM REVIEW, 1997, 39 (04) :605-629
[6]  
SKREKOVSKI R, COMMUNICATION