Pages that link to "Item:Q1091399"

The following pages link to A lower bound for the optimal crossing-free Hamiltonian cycle problem (Q1091399):

Displaying 9 items.

• The NPO-completeness of the longest Hamiltonian cycle problem (Q293205) (← links)
• Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points'' (Q390169) (← links)
• On the crossing number of complete graphs (Q817025) (← links)
• Polygonizations of point sets in the plane (Q1093906) (← links)
• Onion polygonizations (Q1351597) (← links)
• Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem (Q2070343) (← links)
• On asymptotic packing of geometric graphs (Q2081476) (← links)
• Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points (Q2391546) (← links)
• (Q3974694) (← links)