Suivre
Delia Garijo
Titre
Citée par
Citée par
Année
Resolving sets for Johnson and Kneser graphs
RF Bailey, J Cáceres, D Garijo, A González, A Márquez, K Meagher, ...
European Journal of Combinatorics 34 (4), 736-751, 2013
562013
On the determining number and the metric dimension of graphs
J Cáceres, D Garijo, ML Puertas, C Seara
the electronic journal of combinatorics, R63-R63, 2010
512010
The difference between the metric dimension and the determining number of a graph
D Garijo, A González, A Márquez
Applied Mathematics and Computation 249, 487-501, 2014
462014
The determining number of Kneser graphs
J Cáceres, D Garijo, A González, A Márquez, ML Puertas
Discrete Mathematics & Theoretical Computer Science 15 (Graph Theory), 2013
312013
Distinguishing graphs by their left and right homomorphism profiles
D Garijo, A Goodall, J Nešetřil
European Journal of Combinatorics 32 (7), 1025-1053, 2011
232011
Minimizing the error of linear separators on linearly inseparable data
B Aronov, D Garijo, Y Núñez-Rodríguez, D Rappaport, C Seara, J Urrutia
Discrete Applied Mathematics 160 (10-11), 1441-1452, 2012
212012
On the metric dimension, the upper dimension and the resolving number of graphs
D Garijo, A González, A Márquez
Discrete Applied Mathematics 161 (10-11), 1440-1447, 2013
182013
On Hamiltonian alternating cycles and paths
M Claverol, A García, D Garijo, C Seara, J Tejel
Computational Geometry 68, 146-166, 2018
102018
Polynomial graph invariants from homomorphism numbers
D Garijo, A Goodall, J Nešetřil
Discrete Mathematics 339 (4), 1315-1328, 2016
102016
The resolving number of a graph
D Garijo, A González, A Márquez
Discrete Mathematics and Theoretical Computer Science 15 (3), 155-166, 2013
82013
Shortcut sets for plane Euclidean networks
J Cáceres, D Garijo, A González, A Márquez, ML Puertas, P Ribeiro
Electronic Notes in Discrete Mathematics 54, 163-168, 2016
72016
Measuring the error of linear separators on linearly inseparable data
B Aronov, D Garijo, Y Núnez-Rodrıguez, D Rappaport, C Seara, J Urrutia
XIII Encuentros de Geometria Computacional, Zaragoza, Espana, 2009
72009
Computing optimal shortcuts for networks
D Garijo, A Márquez, N Rodríguez, RI Silveira
European Journal of Operational Research 279 (1), 26-37, 2019
62019
Computing the Tutte polynomial of Archimedean tilings
D Garijo, ME Gegúndez, A Márquez, MP Revuelta, F Sagols
Applied Mathematics and Computation 242, 842-855, 2014
62014
Stabbers of line segments in the plane
M Claverol, D Garijo, CI Grima, A Márquez, C Seara
Computational Geometry 44 (5), 303-318, 2011
62011
Shortcut sets for the locus of plane Euclidean networks
J Cáceres, D Garijo, A González, A Márquez, ML Puertas, P Ribeiro
Applied Mathematics and Computation 334, 192-205, 2018
52018
The alternating path problem revisited
M Claverol Aguas, D Garijo, FA Hurtado Díaz, MD Lara Cuevas, ...
XV Spanish Meeting on Computational Geometry, 115-118, 2013
52013
Hypergraphs for computing determining sets of Kneser graphs
J Cáceres, D Garijo, A González, A Márquez, ML Puertas
arXiv preprint arXiv:1111.3252, 2011
52011
Homomorphisms and polynomial invariants of graphs
D Garijo, J Nešetřil, MP Revuelta
European Journal of Combinatorics 30 (7), 1659-1675, 2009
52009
Graph homomorphisms, the Tutte polynomial and “q-state Potts uniqueness”
D Garijo, A Goodall, J Nešetřil
Electronic Notes in Discrete Mathematics 34, 231-236, 2009
52009
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20