The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.

DOI10.1016/j.orl.2003.11.005zbMath1052.05032OpenAlexW2088594973MaRDI QIDQ703228

John J. III Bartholdi, Paul Goldsman

Publication date: 11 January 2005

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2003.11.005

zbMATH Keywords

Hamiltonian cycleTriangulationTriangle meshTriangulated irregular network

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)

Related Items

Hamiltonian triangular refinements and space-filling curves, EULERIAN AND HAMILTONIAN DICYCLES IN DIRECTED HYPERGRAPHS, The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.

Uses Software

• Edgebreaker

Cites Work

• Unnamed Item
• The vertex-adjacency dual of a triangulated irregular network has a Hamiltonian cycle.
• Triangle Strip Compression