Matchings in higher-order Gabriel graphs

DOI10.1016/j.tcs.2015.06.040zbMath1329.05240arXiv1410.0540OpenAlexW2196269078MaRDI QIDQ2355704

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

Publication date: 24 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.0540

zbMATH Keywords

Gabriel graphshigher-order Gabriel graphs

Mathematics Subject Classification ID

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

Related Items (2)

Strong matching of points with geometric shapes ⋮ Bottleneck matchings and Hamiltonian cycles in higher-order Gabriel graphs

Cites Work

• Unnamed Item
• Witness Gabriel graphs
• Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
• Blocking Delaunay triangulations
• Fixed-orientation equilateral triangle matching of point sets
• Toughness and Delaunay triangulations
• Solving the Euclidean bottleneck matching problem by \(k\)-relative neighborhood graphs
• 10-Gabriel graphs are Hamiltonian
• ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
• 20‐relative neighborhood graphs are hamiltonian
• The Factorization of Linear Graphs

This page was built for publication: Matchings in higher-order Gabriel graphs