GENERATING HAMILTONIAN CYCLES IN COMPLETE GRAPHS
Acta mathematica Universitatis Comenianae, Tome 62 (1993) no. 2
H. Fleischner; P. Horak; J. Siran. GENERATING HAMILTONIAN CYCLES IN COMPLETE GRAPHS. Acta mathematica Universitatis Comenianae, Tome 62 (1993) no. 2. http://geodesic.mathdoc.fr/item/AMUC_1993_62_2_a1/
@article{AMUC_1993_62_2_a1,
     author = {H. Fleischner and P. Horak and J. Siran},
     title = {GENERATING {HAMILTONIAN} {CYCLES} {IN} {COMPLETE} {GRAPHS}},
     journal = {Acta mathematica Universitatis Comenianae},
     year = {1993},
     volume = {62},
     number = {2},
     url = {http://geodesic.mathdoc.fr/item/AMUC_1993_62_2_a1/}
}
TY  - JOUR
AU  - H. Fleischner
AU  - P. Horak
AU  - J. Siran
TI  - GENERATING HAMILTONIAN CYCLES IN COMPLETE GRAPHS
JO  - Acta mathematica Universitatis Comenianae
PY  - 1993
VL  - 62
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/AMUC_1993_62_2_a1/
ID  - AMUC_1993_62_2_a1
ER  - 
%0 Journal Article
%A H. Fleischner
%A P. Horak
%A J. Siran
%T GENERATING HAMILTONIAN CYCLES IN COMPLETE GRAPHS
%J Acta mathematica Universitatis Comenianae
%D 1993
%V 62
%N 2
%U http://geodesic.mathdoc.fr/item/AMUC_1993_62_2_a1/
%F AMUC_1993_62_2_a1

Voir la notice de l'article provenant de la source Comenius University

We prove that hamiltonian cycles of complete graphs can be generated in a Gray code manner by means of small local interchanges.