Matchings in Geometric Graphs

@article{Biniaz2016MatchingsIG,
  title={Matchings in Geometric Graphs},
  author={Ahmad Biniaz},
  journal={ArXiv},
  year={2016},
  volume={abs/1610.06457}
}
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
5
Twitter Mentions

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 31 REFERENCES

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

  • Electr. J. Comb.
  • 2012
VIEW 21 EXCERPTS
HIGHLY INFLUENTIAL

Balanced partitions of 3-colored geometric sets in the plane

Sergey Bereg, Ferran Hurtado, +6 authors Kevin Verbeek
  • Discrete Applied Mathematics
  • 2015
VIEW 16 EXCERPTS
HIGHLY INFLUENTIAL