Drawing Hamiltonian cycles with no large angles

zbMath1243.05138MaRDI QIDQ426910

János Pach, Géza Tóth, Adrian Dumitrescu

Publication date: 12 June 2012

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i2p31

zbMATH Keywords

Hamiltonian cyclegeometric graphturning angle

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (5)

Intersecting diametral balls induced by a geometric graph ⋮ Intersecting ellipses induced by a max-sum matching ⋮ On the number of similar instances of a pattern in a finite set ⋮ Bounded-angle spanning tree: modeling networks with angular constraints ⋮ Bounded-angle minimum spanning trees

This page was built for publication: Drawing Hamiltonian cycles with no large angles