A Survey of Combinatorial Gray Codes
SIAM Review
Hamiltonian Cycles with Prescribed Edges in Hypercubes
SIAM Journal on Discrete Mathematics
The edge-pancyclicity of dual-cube extensive networks
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
Nearly tight bounds on the number of Hamiltonian circuits of the hypercube and generalizations
Information Processing Letters
Matching graphs of hypercubes and complete bipartite graphs
European Journal of Combinatorics
Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs
Information Processing Letters
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is odd
AMERICAN-MATH'10 Proceedings of the 2010 American conference on Applied mathematics
Mutually independent Hamiltonian cycles in dual-cubes
The Journal of Supercomputing
Mutually independent Hamiltonian cycles in k-ary n-cubes when k is even
Computers and Electrical Engineering
One-to-one disjoint path covers on k-ary n-cubes
Theoretical Computer Science
On the mutually independent Hamiltonian cycles in faulty hypercubes
Information Sciences: an International Journal
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.