A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.

R.B. Hayward

Discrete & computational geometry (1987)

  • Volume: 2, page 327-344
  • ISSN: 0179-5376; 1432-0444/e

How to cite

top

Hayward, R.B.. "A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.." Discrete & computational geometry 2 (1987): 327-344. <http://eudml.org/doc/131026>.

@article{Hayward1987,
author = {Hayward, R.B.},
journal = {Discrete & computational geometry},
keywords = {complete graph; Hamiltonian cycle; rectilinear drawing},
pages = {327-344},
title = {A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.},
url = {http://eudml.org/doc/131026},
volume = {2},
year = {1987},
}

TY - JOUR
AU - Hayward, R.B.
TI - A Lower Bound for the Optimal Crossing-Free Hamiltonian Cycle Problem.
JO - Discrete & computational geometry
PY - 1987
VL - 2
SP - 327
EP - 344
KW - complete graph; Hamiltonian cycle; rectilinear drawing
UR - http://eudml.org/doc/131026
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.