Perfect Matchings and Hamiltonian paths in Delaunay graphs

Given a set of \(n\) point in the plane, where \(n\) is even, we will show how the standard Delaunay triangulation always contains a perfect matching and how the \(L_1\) Delaunay triangulation always contains a Hamiltonian path.