# Matchings in Geometric Graphs

@article{Biniaz2016MatchingsIG, title={Matchings in Geometric Graphs}, author={Ahmad Biniaz}, journal={ArXiv}, year={2016}, volume={abs/1610.06457} }

- Published in ArXiv 2016
DOI:10.22215/etd/2017-11741

A geometric graph is a graph whose vertex set is a set of points in the plane and whose edge set contains straight-line segments. A matching in a graph is a subset of edges of the graph with no shared vertices. A matching is called perfect if it matches all the vertices of the underling graph. A geometric matching is a matching in a geometric graph. In this thesis, we study matching problems in various geometric graphs. Among the family of geometric graphs we look at complete graphs, complete… CONTINUE READING

#### Citations

##### Publications citing this paper.

## Euclidean Matchings in Ultra-Dense Networks

VIEW 1 EXCERPT

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 31 REFERENCES

## A Bottleneck Matching Problem with Edge-Crossing Constraints

VIEW 19 EXCERPTS

HIGHLY INFLUENTIAL

## Bottleneck Bichromatic Plane Matching of Points

VIEW 79 EXCERPTS

## Balanced Line for a 3-Colored Point Set in the Plane

VIEW 21 EXCERPTS

HIGHLY INFLUENTIAL

## On the Problem of Decomposing a Graph into n Connected Factors

VIEW 13 EXCERPTS

HIGHLY INFLUENTIAL

## Balanced partitions of 3-colored geometric sets in the plane

VIEW 16 EXCERPTS

HIGHLY INFLUENTIAL

## Matchings in higher-order Gabriel graphs

VIEW 8 EXCERPTS