Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs

DOI10.1016/J.IPL.2019.105869MaRDI QIDQ2338215zbMATH OpenOpenAlexWikidataFDO

Authors Ahmad Biniaz, Anil Maheshwari, Michiel Smid

Publication date 21 November 2019

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2019.105869

zbMATH Keywords

computational geometryEuclidean bottleneck matchingsEuclidean Hamiltonian cyclesGabriel graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Matchings in higher-order Gabriel graphs
• 10-Gabriel graphs are Hamiltonian
• Hamiltonicity for convex shape Delaunay and Gabriel graphs
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• Computing Euclidean bottleneck matchings in higher dimensions

Cites work

• 10-Gabriel graphs are Hamiltonian
• 20‐relative neighborhood graphs are hamiltonian
• Hamiltonicity for convex shape Delaunay and Gabriel graphs
• Matchings in higher-order Gabriel graphs
• On structural and graph theoretic properties of higher order Delaunay graphs
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• The densest packing of 12 congruent circles in a circle

Cited in

(3)

• Matchings in higher-order Gabriel graphs
• Hamiltonicity for convex shape Delaunay and Gabriel graphs
• Hamiltonicity for convex shape Delaunay and Gabriel graphs

This page was built for publication: Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs

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