Higher-order triangular-distance Delaunay graphs: graph-theoretical properties

DOI10.1016/j.comgeo.2015.07.003zbMath1329.05175MaRDI QIDQ904106

Anil Maheshwari, Ahmad Biniaz, Michiel H. M. Smid

Publication date: 15 January 2016

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2015.07.003

zbMATH Keywords

matching; Hamiltonian cycle; Delaunay graph; triangular distance

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C12: Distance in graphs

05C40: Connectivity

05C45: Eulerian and Hamiltonian graphs