Some properties of k-Delaunay and k-Gabriel graphs
DOI10.1016/J.COMGEO.2012.04.006zbMATH Open1254.05042OpenAlexW2171133375MaRDI QIDQ691765FDOQ691765
Authors: Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristán, Maria Saumell 
Publication date: 4 December 2012
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.04.006
Recommendations
- On structural and graph theoretic properties of higher order Delaunay graphs
- Convex hulls and metric Gabriel graphs
- Hamiltonicity for convex shape Delaunay and Gabriel graphs
- Hamiltonicity for convex shape Delaunay and Gabriel graphs
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
- Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
- On geometric constructions of \((k,g)\)-graphs
- scientific article; zbMATH DE number 3877217
- scientific article; zbMATH DE number 500365
- scientific article; zbMATH DE number 4085714
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Title not available (Why is that?)
- Routing with guaranteed delivery in ad hoc wireless networks
- Delaunay graphs are almost as good as complete graphs
- On the chromatic number of some geometric type Kneser graphs
- Coloring relatives of intervals on the plane. I: Chromatic number versus girth
- Classes of graphs which approximate the complete Euclidean graph
- On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
- Improved upper bound on the stretch factor of Delaunay triangulations
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
- Covering and coloring problems for relatives of intervals
- On structural and graph theoretic properties of higher order Delaunay graphs
- Higher order Delaunay triangulations
- Optimization for first order Delaunay triangulations
- On the number of higher order Delaunay triangulations
- Structural tolerance and Delaunay triangulation
- Geometric Thickness of Complete Graphs
- On crossing numbers of geometric proximity graphs
- On circles containing the maximum number of points
- Some extremal results on circles containing points
- Testing bipartiteness of geometric intersection graphs
- A Lower Bound for the Number of Vertices of a Graph
Cited In (13)
- Matchings in higher-order Gabriel graphs
- Proximity structures for geometric graphs
- On structural and graph theoretic properties of higher order Delaunay graphs
- Hamiltonicity for convex shape Delaunay and Gabriel graphs
- Higher-order triangular-distance Delaunay graphs: graph-theoretical properties
- Proximity graphs: {\(E, \delta\)}, {\(\Delta\)}, {\(\chi\)} and {\(\omega\)}
- 3-coloring arrangements of line segments with 4 slopes is hard
- On the Spanning Ratio of Gabriel Graphs and beta-Skeletons
- Quantitative classification of vortical flows based on topological features using graph matching
- On the edge crossing properties of Euclidean minimum weight Laman graphs
- Coloring certain proximity graphs
- Improving upper and lower bounds for the total number of edge crossings of Euclidean minimum weight Laman graphs
- Title not available (Why is that?)
This page was built for publication: Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691765)
