Drawing Hamiltonian cycles with no large angles

MaRDI QIDQ426910zbMATH OpenFDO

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

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Hamiltonian cyclegeometric graphturning angle

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Drawing Hamiltonian cycles with no large angles
• Hamiltonian cycles in planar triangulations with no separating triangles
• Hamilton cycles in planar graphs and Venn diagrams
• scientific article; zbMATH DE number 3912424
• scientific article; zbMATH DE number 568821
• Hamilton cycles in plane triangulations
• Hamiltonian Paths and Cycles in Planar Graphs
• Hamiltonian cycles in polyhedral maps
• Hamilton Cycles in Oriented Graphs
• scientific article; zbMATH DE number 5901724

Cited in

(10)

• Intersecting diametral balls induced by a geometric graph
• Angle-restricted tours in the plane.
• Going around in circles
• Drawing Hamiltonian cycles with no large angles
• Acute tours in the plane
• Bounded-angle minimum spanning trees
• Acute tours in the plane
• On the number of similar instances of a pattern in a finite set
• Intersecting ellipses induced by a max-sum matching
• Bounded-angle spanning tree: modeling networks with angular constraints

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426910)