Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph.  give bounds on the following combinatorial and geometric properties of these graphs: spanning ratio, diameter, connectivity, chromatic number, and minimum number of layers necessary to partition the edges of the graphs so that no two edges of the same layer cross.
['Prosenjit Bose', 'Sébastien Collette', 'Ferran Hurtado', 'Matias Korman', 'Stefan Langerman', 'Vera Sacristán', 'Maria Saumell']
I am writing a research paper on a idea Some properties of k-Delaunay and k-Gabriel graphs
[{"from": "human", "value": "I am writing a research paper on a idea Some properties of k-Delaunay and k-Gabriel graphs"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph.  give bounds on the following combinatorial and geometric properties of these graphs: spanning ratio, diameter, connectivity, chromatic number, and minimum number of layers necessary to partition the edges of the graphs so that no two edges of the same layer cross."}]