# Maximum Matchings and Minimum Blocking Sets in $\Theta_6$-Graphs

@inproceedings{Biedl2019MaximumMA, title={Maximum Matchings and Minimum Blocking Sets in \$\Theta_6\$-Graphs}, author={Therese C. Biedl and Ahmad Biniaz and Veronika Irvine and Kshitij Jain and Philipp Kindermann and Anna Lubiw}, year={2019} }

- Published 2019

Θ6-Graphs graphs are important geometric graphs that have many applications especially in wireless sensor networks. They are equivalent to Delaunay graphs where empty equilateral triangles take the place of empty circles. We investigate lower bounds on the size of maximum matchings in these graphs. The best known lower bound is n/3, where n is the number of vertices of the graph. Babu et al. (2014) conjectured that any Θ6-graph has a (near-)perfect matching (as is true for standard Delaunay… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 30 REFERENCES

## Toughness and Delaunay Triangulations

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## The Factorization of Linear Graphs

VIEW 9 EXCERPTS

HIGHLY INFLUENTIAL

## Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## On shape Delaunay tessellations

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Fixed-Orientation Equilateral Triangle Matching of Point Sets

VIEW 4 EXCERPTS

HIGHLY INFLUENTIAL

## Witness proximity graphs and other geometric problems

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## There are planar graphs almost as good as the complete graph

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Approximation algorithms for shortest path motion planning

VIEW 5 EXCERPTS

HIGHLY INFLUENTIAL

## Approximating the Complete Euclidean Graph

VIEW 6 EXCERPTS

HIGHLY INFLUENTIAL

## Sur le couplage maximum d’un graphe

VIEW 8 EXCERPTS

HIGHLY INFLUENTIAL

#### Similar Papers

Loading similar papers…