Geodesic
Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
The electronic journal of combinatorics, Tome 17 (2010)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
Marco Buratti has conjectured that, given an odd prime $p$ and a multiset $L$ containing $p-1$ integers taken from $\{1,\ldots,(p-1)/2\}$, there exists a Hamiltonian path in the complete graph with $p$ vertices whose multiset of edge-lengths is equal to $L$ modulo $p$. We give a positive answer to this conjecture in the case of multisets of the type $\{1^a,2^b,3^c\}$ by completely classifying such multisets that are linearly or cyclically realizable.
DOI : 10.37236/316
Classification : 05C38 
Stefano Capparelli; Alberto Del Fra. Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3. The electronic journal of combinatorics, Tome 17 (2010). doi: 10.37236/316
@article{10_37236_316,
     author = {Stefano Capparelli and Alberto Del Fra},
     title = {Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3},
     journal = {The electronic journal of combinatorics},
     year = {2010},
     volume = {17},
     doi = {10.37236/316},
     zbl = {1215.05095},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/316/}
}
TY  - JOUR
AU  - Stefano Capparelli
AU  - Alberto Del Fra
TI  - Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
JO  - The electronic journal of combinatorics
PY  - 2010
VL  - 17
UR  - http://geodesic.mathdoc.fr/articles/10.37236/316/
DO  - 10.37236/316
ID  - 10_37236_316
ER  - 
%0 Journal Article
%A Stefano Capparelli
%A Alberto Del Fra
%T Hamiltonian paths in the complete graph with edge-lengths 1, 2, 3
%J The electronic journal of combinatorics
%D 2010
%V 17
%U http://geodesic.mathdoc.fr/articles/10.37236/316/
%R 10.37236/316
%F 10_37236_316

Cité par Sources :