Graphs of Non-Crossing Perfect Matchings

@article{Hernando2002GraphsON,
  title={Graphs of Non-Crossing Perfect Matchings},
  author={M. Carmen Hernando and Ferran Hurtado and Marc Noy},
  journal={Graphs and Combinatorics},
  year={2002},
  volume={18},
  pages={517-532}
}
Let Pn be a set of n m points that are the vertices of a convex polygon and let Mm be the graph having as vertices all the perfect matchings in the point set Pn whose edges are straight line segments and do not cross and edges joining two perfect matchings M and M if M M a b c d a d b c for some points a b c d of Pn We prove the following results about Mm its diameter is m it is bipartite for every m the connectivity is equal to m it has no Hamilton path for m odd m and nally it has a Hamilton… CONTINUE READING
Highly Cited
This paper has 34 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

A

  • C. Hernando, F. Hurtado
  • M arquez, M. Mora and M. Noy, Geometric tree…
  • 1999
1 Excerpt

Graphs and digraphs

  • G. Chartrand, L. Lesniak
  • 3d edition, Chapman and Hall
  • 1996

The connectivity of Z-transformation graphs of perfect matchings of polyominos

  • H. Zhang
  • Discrete Math. 158
  • 1996
1 Excerpt

Rotation distance

  • D. D. Sleator, R. E. Tarjan, W. P. Thurston
  • triangulations and hy- perbolic geometry, J…
  • 1988
1 Excerpt

Similar Papers

Loading similar papers…