A lower bound for the optimal crossing-free Hamiltonian cycle problem

DOI10.1007/BF02187887zbMath0623.05037MaRDI QIDQ1091399

Ryan B. Hayward

Publication date: 1987

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131026

zbMATH Keywords

Hamiltonian cyclecomplete graphrectilinear drawing

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (6)

Polygonizations of point sets in the plane ⋮ Onion polygonizations ⋮ Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points ⋮ Reprint of: ``Upward planar embedding of an \(n\)-vertex oriented path on \(O(n^2)\) points ⋮ On asymptotic packing of geometric graphs ⋮ On the crossing number of complete graphs

Cites Work

• Crossing-Free Subgraphs
• Crossing Number Problems
• Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)
• Unnamed Item

This page was built for publication: A lower bound for the optimal crossing-free Hamiltonian cycle problem