Graphs of non-crossing perfect matchings (2001)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Noy, Marc
Let Pn be a set of n = 2m 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...
Graphs of non-crossing perfect matchings (2001)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Noy, Marc
Let Pn be a set of n = 2m 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...
Graphs of non-crossing perfect matchings (2001)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Noy, Marc
Let Pn be a set of n = 2m points that are the vertices of a convex polygon, and let Mmbe the graph having as vertices all the perfect matchings in the point set Pn whose edgesare straight line...
Graphs of non-crossing perfect matchings (2001)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Noy, Marc
Let Pn be a set of n = 2m 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...
Geometric tree graphs of points in convex position (1997)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Márquez Pérez, Alberto, Mora, Mercè, Noy, Marc
Given a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T(P)$ whose vertices are non-crossing rectilinear spanning trees of $P$, and where two trees $T_1$ and...
Geometric tree graphs of points in convex position (1997)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Márquez Pérez, Alberto, Mora, Mercè, Noy, Marc
Given a set $P$ of points in the plane, the geometric tree graph of$P$ is defined as the graph $T(P)$ whose vertices are non-crossingrectilinear spanning trees of $P$, and where two trees $T_1$ and...
Geometric tree graphs of points in convex position (1997)
Hernando Martín, M. Carmen, Hurtado Díaz, Fernando A. (Fernando Alfredo), Márquez Pérez, Alberto, Mora, Mercè, Noy, Marc
Given a set $P$ of points in the plane, the geometric tree graph of $P$ is defined as the graph $T(P)$ whose vertices are non-crossing rectilinear spanning trees of $P$, and where two trees $T_1$ and...