- idUS
- Listar por autor
Listar por autor "Garijo Royo, Delia"
Mostrando ítems 21-40 de 80
-
Artículo
Hexagonal Tilings and Locally C6 Graphs
Garijo Royo, Delia; Gitler, I.; Márquez Pérez, Alberto; Revuelta Marchena, María Pastora (Cornell University, 2005)We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural ...
-
Artículo
Hexagonal Tilings: Tutte Uniqueness
Garijo Royo, Delia; Márquez Pérez, Alberto; Revuelta Marchena, María Pastora (Cornell University, 2005)We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined by their Tutte polynomial, showing as an example how to apply this technique to the toroidal hexagonal tiling.
-
Ponencia
Homomorphisms and Polynomial Invariants of Graphs
Revuelta Marchena, María Pastora; Garijo Royo, Delia; Nesetril, Jaroslav (2007)This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection ...
-
Artículo
Homomorphisms and polynomial invariants of graphs
Garijo Royo, Delia; Nesetril, Jaroslav; Revuelta Marchena, María Pastora (Elsevier, 2009)This paper initiates a general study of the connection between graph homomorphisms and the Tutte polynomial. This connection ...
-
Artículo
Homomorphisms between graphs embedded in surfaces
Garijo Royo, Delia; Goodall, Andrew; Vena Cros, Lluís (Elsevier, 2024-05)We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and ...
-
Ponencia
Improved enumeration of simple topological graphs
Kynčl, Jan (2013)A simple topological graph T = (V (T ), E(T )) is a drawing of a graph in the plane where every two edges have at most one ...
-
Ponencia
K-Factores en nubes bicromáticas
Grima Ruiz, Clara Isabel; Atienza Martínez, María Nieves; Cortés Parejo, María del Carmen; Garijo Royo, Delia; Valenzuela Muñoz, Jesús; Villar Liñán, María Trinidad (2007)Consideramos una colección de puntos bicromática y nos preguntamos cuántos puntos adicionales son necesarios considerar ...
-
Ponencia
Measuring the error of linear separators on linearly inseparable data
Aronov, Boris; Garijo Royo, Delia; Núñez Rodríguez, Yurai; Rappaport, David; Seara Ojea, Carlos; Urrutia, Jorge (Prensas Universitarias de Zaragoza, 2009-06)Given linearly inseparable sets R of red points and B of blue points, we consider several measures of how far they are ...
-
Ponencia
Metaheuristic approaches for the minimum dilation triangulation problem
Dorzán, María Gisela; Leguizamón, Mario Guillermo; Mezura Montes, Efrén; Hernández Peñalver, Gregorio (2013)We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the ...
-
Artículo
Minimizing the error of linear separators on linearly inseparable data
Aronov, Boris; Garijo Royo, Delia; Núñez Rodríguez, Yurai; Rappaport, David; Seara, Carlos; Urrutia, Jorge (Elsevier, 2012)Given linearly inseparable sets R of red points and B of blue points, we consider several measures of how far they are ...
-
Artículo
Monochromatic geometric k-factors for bicolored point sets with auxiliary points
Garijo Royo, Delia; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Robles Arias, Rafael; Valenzuela Muñoz, Jesús (2014)Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We ...
-
Artículo
Monochromatic geometric k-factors in red-blue sets with white and Steiner points
Garijo Royo, Delia; Garrido Vizuete, María de los Angeles; Grima Ruiz, Clara Isabel; Márquez Pérez, Alberto; Moreno González, Auxiliadora; Portillo Fernández, José Ramón; Reyes Colume, Pedro; Robles Arias, Rafael; Valenzuela Muñoz, Jesús (2009)We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible ...
-
Ponencia
Monotone crossing number of complete graphs
Balko, Martin; Fulek, Radoslav; Kynčl, Jan (2013)In 1958, Hill conjectured that the minimum number of crossings in a drawing of Kn is exactly Z(n) = 1/4 n-1/2/2 n−2/2 ...
-
Artículo
New results on the robust coloring problem
Garijo Royo, Delia; Márquez Pérez, Alberto; Robles Arias, Rafael (Springer, 2024-03-23)Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; ...
-
Ponencia
Note on the number of obtuse angles in point sets
Fabila Monroy, Ruy; Huemer, Clemens; Tramuns Figueras, Eulàlia (2013)In 1979 Conway, Croft, Erd\H{o}s and Guy proved that every set SS of nn points in general position in the plane determines ...
-
Ponencia
On 4-connected geometric graphs
García Olaverri, Alfredo; Huemer, Clemens; Tejel Altarriba, Francisco Javier; Valtr, Pavel (2013)Given a set S of n points in the plane, in this paper we give a necessary and sometimes sufficient condition to build a 4-connected non-crossing geometric graph on S.
-
Artículo
On Hamiltonian alternating cycles and paths
Claverol, Mercé; García, Alfredo; Garijo Royo, Delia; Seara, Carlos; Tejel, Javier (Elsevier, 2018)We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an ...
-
Ponencia
On making a graph crossing-critical
Hernández Vélez, César Israel; Leaños Macías, Jesús (2013)A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recently it was proved that ...
-
Ponencia
On the barrier-resilience of arrangements of ray-sensors
Kirkpatrick, David; Yang, Boting; Zilles, Sandra (2013)Given an arrangement A of n sensors and two points s and t in the plane, the barrier resilience of A with respect to s and ...
-
Artículo
On the determining number and the metric dimension of graphs
Cáceres, José; Garijo Royo, Delia; Puertas, María Luz; Seara, Carlos (Combinatorics.org, 2010)This paper initiates a study on the problem of computing the difference between the metric dimension and the determining ...