Geodesic
Gray codes in graphs
Mathematica slovaca, Tome 44 (1994) no. 4, pp. 395-412
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library

Voir la notice de l'article

Classification : 05A05, 05C38, 05C45, 05C78, 94A29 
@article{MASLO_1994_44_4_a0,
     author = {Knor, Martin},
     title = {Gray codes in graphs},
     journal = {Mathematica slovaca},
     pages = {395--412},
     year = {1994},
     volume = {44},
     number = {4},
     mrnumber = {1301949},
     zbl = {0809.05065},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/MASLO_1994_44_4_a0/}
}
TY  - JOUR
AU  - Knor, Martin
TI  - Gray codes in graphs
JO  - Mathematica slovaca
PY  - 1994
SP  - 395
EP  - 412
VL  - 44
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MASLO_1994_44_4_a0/
LA  - en
ID  - MASLO_1994_44_4_a0
ER  - 
%0 Journal Article
%A Knor, Martin
%T Gray codes in graphs
%J Mathematica slovaca
%D 1994
%P 395-412
%V 44
%N 4
%U http://geodesic.mathdoc.fr/item/MASLO_1994_44_4_a0/
%G en
%F MASLO_1994_44_4_a0
Knor, Martin. Gray codes in graphs. Mathematica slovaca, Tome 44 (1994) no. 4, pp. 395-412. http://geodesic.mathdoc.fr/item/MASLO_1994_44_4_a0/

[1] BIGGS N.: Some odd graph theory. In: Second International Conference on Combinatorial Mathematics (New York, 1978). Ann. New York Acad. Sci. 319, New York Acad. Sci., New York, 1979, pp. 71-81. | MR

[2] BITNER J. R., EHRLICH G., REINGOLD E. M.: Efficient generation of the binary reflected Gray code and its applications. Comm. ACM 19 (1976), 517-521. | MR | Zbl

[3] BUCK M., WIEDEMANN D.: Gray codes with restricted density. Discrete Math. 48 (1984), 163-171. | MR | Zbl

[4] CHASE P. J.: Algorithm 382 combinations of m out of n objects. Comm. ACM 13 (1970), 368, 376.

[5] CHASE P. J.: Transposition graphs. SIAM J. Comput. 2 (1973), 128-133. | MR | Zbl

[6] EHRLICH G.: Loopless algorithms for generating permutations, combinations, and other combinatorial configurations. J. Assoc. Comput. Mach. 20 (1973), 500-513. | MR | Zbl

[7] GILBERT E. N.: Gray codes and paths on the n-cube. Bell System Tech. J. 37 (1958), 815-826. | MR

[8] GRANT D. D., HOLTON D. A.: Stable and semi-stable unicyclic graphs. Discrete Math. 9 (1974), 277-288. | MR | Zbl

[9] GRAY F.: Pulse code communications. U. S. Patent 2632 058, March 17, 1953.

[10] HU T. C, RUSKEY F.: Generating binary trees lexicographically. SIAM J. Comput. 6 (1977), 745-758. | MR | Zbl

[11] JOHNSON S. M.: Generation of permutations by adjacent transposition. Math. Comp. 17 (1963), 282-285. | MR | Zbl

[12] JOICHI S. T., WHITE D. E.: Gray codes in graphs of subsets. Discrete Math. 31 (1980), 29-41. | MR | Zbl

[13] JOICHI S. T., WHITE D. E., WILLIAMSON S. G.: Combinatorial Gray codes. SIAM J. Comput. 9 (1980), 130-141. | MR | Zbl

[14] MEREDITH G. H. J., LLOYD E. K.: The Hamiltonian graphs $O_4$ to $O_7$. Combinatorica (1972), 229-236. | MR

[15] PROSKUROWSKI A., RUSKEY F.: Binary tree Gray codes. J. Algorithms 6 (1985), 225-238. | MR | Zbl

[16] PROSKUROWSKI A., RUSKEY F.: Generating binary trees by transpositions. In: SWAT 88. Lecture Notes in Comput. Sci. 318, Springer, New York-Berlin, 1988, pp. 199-207. | MR | Zbl

[17] RUSKEY F.: Adjacent interchange generation of combinations. J. Algorithms 9 (1988), 162-180. | MR | Zbl

[18] SAVAGE C. D.: Gray code sequences of partitions. J. Algorithms 10 (1989), 557-595. | MR | Zbl

[19] TCHUENTE M.: Generation of permutations by graphical exchanges. Ars Combin. 14 (1982), 115-122. | MR | Zbl