Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)

DOI10.1016/0095-8956(80)90041-6zbMath0373.05051OpenAlexW2071731426MaRDI QIDQ5905997

W. O. J. Moser, Monroe M. Newborn

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90041-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

A lower bound for the optimal crossing-free Hamiltonian cycle problem ⋮ Spiral Serpentine Polygonization of a Planar Point Set ⋮ On polygons enclosing point sets. II

Cites Work

• Crossing Number Problems
• Unnamed Item

This page was built for publication: Optimal crossing-free Hamiltonian circuit drawings of \(K_n\)