Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2007_14_3_a6,
author = {A. L. Perezhogin},
title = {{\CYRO}{\cyrb}~{\cyra}{\cyrv}{\cyrt}{\cyro}{\cyrm}{\cyro}{\cyrr}{\cyrf}{\cyri}{\cyrz}{\cyrm}{\cyra}{\cyrh} {\cyrc}{\cyri}{\cyrk}{\cyrl}{\cyro}{\cyrv} {\cyrv}~$n$-{\cyrm}{\cyre}{\cyrr}{\cyrn}{\cyro}{\cyrm} {\cyrb}{\cyru}{\cyrl}{\cyre}{\cyrv}{\cyro}{\cyrm} {\cyrk}{\cyru}{\cyrb}{\cyre}},
journal = {Diskretnyj analiz i issledovanie operacij},
pages = {67--79},
publisher = {mathdoc},
volume = {14},
number = {3},
year = {2007},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DA_2007_14_3_a6/}
}
A. L. Perezhogin. Об~автоморфизмах циклов в~$n$-мерном булевом кубе. Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 3, pp. 67-79. http://geodesic.mathdoc.fr/item/DA_2007_14_3_a6/
[1] Evdokimov A. A., “O numeratsii podmnozhestv konechnogo mnozhestva”, Metody diskretnogo analiza v reshenii kombinatornykh zadach, Sb. nauch. tr., 34, In-t matematiki SO AN SSSR, Novosibirsk, 1980, 8–26 | MR
[2] Evdokimov A. A., Perezhogin A. L., “Minimalnye numeratsii podmnozhestv konechnogo mnozhestva i problema gamiltonovosti grafa srednikh sloev giperkuba”, Diskret. analiz i issled. operatsii. Ser. 1, 4:4 (1997), 6–12 | MR
[3] Zanten A. Ya., van, “Sokhranyayuschie rasstoyaniya tsiklicheskie kody na lineinom bazise”, Diskret. analiz i issled. operatsii. Ser. 1, 5:4 (1998), 38–44 | MR | Zbl
[4] Perezhogin A. L., “O lokalno izometricheskom kodirovanii naturalnykh chisel”, Diskret. analiz i issled. operatsii. Ser. 1, 3:4 (1996), 69–76 | MR | Zbl
[5] Perezhogin A. L., “O tsiklicheskikh $\langle m,n\rangle$-numeratsiyakh”, Diskret. analiz i issled. operatsii. Ser. 1, 5:4 (1998), 61–70 | MR | Zbl
[6] Perezhogin A. L., Potapov V. N., “O covershennykh parosochetaniyakh v dvoichnom kube”, Diskretnye modeli v teorii upravlyayuschikh sistem, VII Mezhdunarodnaya konferentsiya. Trudy (Pokrovskoe, 4–6 marta 2006 g.), MAKS Press, M., 2006, 272–277
[7] Kholl M., Teoriya grupp, Izd-vo inostrannoi literatury, M., 1962
[8] Dejter I. J., Delgado A. A., “Classes of Hamilton cycles in the 5-cube”, J. Combin. Math. and Combin. Computing (to appear) | MR
[9] Duffus D. A., Kierstead H. A., Snevily H. S., “An explicit 1-factorization in the middle of the Boolean lattice”, J. Combin. Theory. Ser. A, 65:2 (1994), 334–342 | DOI | MR | Zbl
[10] Duffus D., Sands B., Woodrow R., “Lexicographic matchings cannot form Hamiltonian cycles”, Order, 5:2 (1988), 149–161 | DOI | MR | Zbl
[11] Goddyn L., Gvozdjak P., “Binary Gray codes with long bit runs”, The Electronic J. Combinatorics, 10:R27 (2003) | MR | Zbl
[12] Goddyn L., Lawrence G. M., Nemeth E., “Gray codes with optimized run lengths”, Utilitas Mathematica, 34 (1988), 179–192 | MR | Zbl
[13] Kierstead H. A., Trotter W. T., “Explicit matchings in the middle levels of the Boolean lattice”, Order, 5:2 (1988), 163–171 | DOI | MR | Zbl
[14] Kreweras G., “Some remarks about Hamiltonian circuits and cycles on hypercubes”, Bull. Inst. Comb. Appl., 12 (1994), 19–22 | MR | Zbl
[15] Savage C. D., “A survey of combinatorial Gray codes”, SIAM Rev., 39:4 (1997), 605–629 | DOI | MR | Zbl
[16] Savage C. D., Shields I., “A Hamilton path heuristic with applications to the middle two levels problem”, Congressus Numerantium, 140 (1999), 161–178 | MR | Zbl
[17] Savage C. D., Winkler P., “Monotone Gray codes and the middle two levels problem”, J. Combinatorial Theory. Ser. A, 70:2 (1995), 230–248 | DOI | MR | Zbl