Extending Perfect Matchings to Gray Codes with Prescribed Ends

Electronic Journal Of Combinatorics

Petr Gregor¹ 

关键词: Gray code;    Hypercube;    Hamiltonian path;    Perfect matching;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A binary (cyclic) Gray code is a (cyclic) ordering of all binary strings of the same length such that any two consecutive strings differ in a single bit. This corresponds to a Hamiltonian path (cycle) in the hypercube. Fink showed that every perfect match

【 授权许可】

Others