Geodesic
A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
Discrete & computational geometry, Tome 2 (1987), pp. 327-344.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : complete graph, Hamiltonian cycle, rectilinear drawing 
@article{DCG_1987__2_131026,
     author = {R.B. Hayward},
     title = {A {Lower} {Bound} for the {Optimal} {Crossing-Free} {Hamiltonian} {Cycle} {Problem.}},
     journal = {Discrete & computational geometry},
     pages = {327--344},
     publisher = {mathdoc},
     volume = {2},
     year = {1987},
     zbl = {0623.05037},
     url = {http://geodesic.mathdoc.fr/item/DCG_1987__2_131026/}
}
TY  - JOUR
AU  - R.B. Hayward
TI  - A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
JO  - Discrete & computational geometry
PY  - 1987
SP  - 327
EP  - 344
VL  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1987__2_131026/
ID  - DCG_1987__2_131026
ER  - 
%0 Journal Article
%A R.B. Hayward
%T A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
%J Discrete & computational geometry
%D 1987
%P 327-344
%V 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1987__2_131026/
%F DCG_1987__2_131026
R.B. Hayward. A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.. Discrete & computational geometry, Tome 2 (1987), pp. 327-344. http://geodesic.mathdoc.fr/item/DCG_1987__2_131026/