Research problems on Gray codes and universal cycles

被引：19
作者：
Jackson, Brad [1 ]
Stevens, Brett [2 ]
Hurlbert, Glenn [3 ]
机构：
[1] San Jose State Univ, Dept Math, San Jose, CA 95192 USA
[2] Carleton Univ, Sch Math & Stat, Ottawa, ON K1S 5B6, Canada
[3] Arizona State Univ, Dept Math & Stat, Tempe, AZ 85287 USA
来源：
DISCRETE MATHEMATICS | 2009年 / 309卷 / 17期
关键词：
Problems; LINEAR EXTENSIONS; CAYLEY-GRAPHS; HAMILTON CYCLES; K-SUBSETS; MATCHINGS; ALGORITHM; NECKLACES; EXTEND; POSETS; PATHS;
D O I：
10.1016/j.disc.2009.04.002
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Open problems arising from the Workshop on Generalizations of de Bruijn cycles and Gray Codes at the Banff International Research Station in December, 2004. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：5341 / 5348
页数：8
相关论文
共 33 条
[1]   AVERAGE COST OF DUVALS ALGORITHM FOR GENERATING LYNDON WORDS [J].
BERSTEL, J ;
POCCHIOLA, M .
THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) :415-425
[2]  
BIRO C, 1 3 LEVELS ORDER PRE
[3]   UNIVERSAL CYCLES FOR COMBINATORIAL STRUCTURES [J].
CHUNG, F ;
DIACONIS, P ;
GRAHAM, R .
DISCRETE MATHEMATICS, 1992, 110 (1-3) :43-59
[4]  
CHUNG F, DISCUSSION STOMACH I
[5]   Hamiltonian cycles and paths in Cayley graphs and digraphs - A survey [J].
Curran, SJ ;
Gallian, JA .
DISCRETE MATHEMATICS, 1996, 156 (1-3) :1-18
[6]  
Diaconis P., 2008, LIFETIME PUZZLES, P35
[7]  
FAN CT, 1985, ARS COMBINATORIA, V19A, P205
[8]   COLORINGS OF DIAGRAMS OF INTERVAL ORDERS AND ALPHA-SEQUENCES OF SETS [J].
FELSNER, S ;
TROTTER, WT .
DISCRETE MATHEMATICS, 1995, 144 (1-3) :23-31
[9]   Perfect matchings extend to Hamilton cycles in hypercubes [J].
Fink, Jiri .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (06) :1074-1076
[10]  
FREDRICKSEN H, 1978, DISCRETE MATH, V23, P207, DOI 10.1016/0012-365X(78)90002-X
1234