On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
On the Steiner, geodetic and hull numbers of graphs (2003)
Hernando Martín, M. Carmen, Tao, Jiang, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W)...
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
On the Steiner, geodetic and hull numbers of graphs (2003)
Hernando Martín, M. Carmen, Tao, Jiang, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimumorder that contains all of W. Let S(W) denote the set of all vertices in G that lie onsome Steiner W-tree; we call S(W)...
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G ifthere exists a vertex u such that no neighbor of v is further away from u than v.We obtain a number of properties...
On monophonic sets in graphs (2003)
Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
On monophonic sets in graphs (2003)
Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
On the Steiner, geodetic and hull numbers of graphs (2003)
Hernando Martín, M. Carmen, Tao, Jiang, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
Given a graph G and a subset W ? V (G), a Steiner W-tree is a tree of minimum order that contains all of W. Let S(W) denote the set of all vertices in G that lie on some Steiner W-tree; we call S(W)...
On monophonic sets in graphs (2003)
Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Seara, Carlos
On geodetic sets formed by boundary vertices (2003)
Cáceres González, José, Hernando Martín, M. Carmen, Mora, Mercè, Pelayo Melero, Ignacio, Puertas González, María Luz, Seara, Carlos
Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties...
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...
Complejidad de estructuras geométricas y combinatorias (1999)
RESUMEN En la presente memoria, se abordan cuatro problemas, existiendo en todos ellos una gran interacción entre la combinatoria y la geometría. El primer problema que se estudia es la...
Complejidad de estructuras geométricas y combinatorias (1999)
RESUMEN En la presente memoria, se abordan cuatro problemas, existiendo en todos ellos una gran interacción entre la combinatoria y la geometría. El primer problema que se estudia es la...
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...