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

DOI10.1016/0095-8956(80)90041-6zbMath0431.05015OpenAlexW2071731426MaRDI QIDQ5904318

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

zbMATH Keywords

drawingHamiltonian circuitscrossing free

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Onion polygonizations ⋮ Parameterized analysis and crossing minimization problems ⋮ Connecting the dots (with minimum crossings)

Cites Work

• Crossing Number Problems
• Unnamed Item

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