Delia Garijo

Orcid: 0000-0002-0493-4754

According to our database1, Delia Garijo authored at least 30 papers between 2007 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Homomorphisms between graphs embedded on surfaces.
CoRR, 2023

2022
New results on the robust coloring problem.
CoRR, 2022

2021
Continuous mean distance of a weighted graph.
CoRR, 2021

2019
Computing optimal shortcuts for networks.
Eur. J. Oper. Res., 2019

2018
Preface.
Electron. Notes Discret. Math., 2018

On Hamiltonian alternating cycles and paths.
Comput. Geom., 2018

Shortcut sets for the locus of plane Euclidean networks.
Appl. Math. Comput., 2018

2017
Stabbing segments with rectilinear objects.
Appl. Math. Comput., 2017

2016
Shortcut sets for plane Euclidean networks (Extended abstract).
Electron. Notes Discret. Math., 2016

Polynomial graph invariants from homomorphism numbers.
Discret. Math., 2016

2014
Monochromatic geometric k-factors for bicolored point sets with auxiliary points.
Inf. Process. Lett., 2014

On the number of <i>B</i>B-flows of a graph.
Eur. J. Comb., 2014

The difference between the metric dimension and the determining number of a graph.
Appl. Math. Comput., 2014

Computing the Tutte polynomial of Archimedean tilings.
Appl. Math. Comput., 2014

2013
Resolving sets for Johnson and Kneser graphs.
Eur. J. Comb., 2013

The resolving number of a graph.
Discret. Math. Theor. Comput. Sci., 2013

The determining number of Kneser graphs.
Discret. Math. Theor. Comput. Sci., 2013

On the metric dimension, the upper dimension and the resolving number of graphs.
Discret. Appl. Math., 2013

2012
Reporting Bichromatic Segment Intersections from Point Sets.
Int. J. Comput. Geom. Appl., 2012

Separability of Point Sets by k-Level Linear Classification Trees.
Int. J. Comput. Geom. Appl., 2012

Minimizing the error of linear separators on linearly inseparable data.
Discret. Appl. Math., 2012

2011
Contractors for flows.
Electron. Notes Discret. Math., 2011

Distinguishing graphs by their left and right homomorphism profiles.
Eur. J. Comb., 2011

Stabbers of line segments in the plane.
Comput. Geom., 2011

2010
On the Determining Number and the Metric Dimension of Graphs.
Electron. J. Comb., 2010

Hexagonal Tilings: Tutte Uniqueness.
Ars Comb., 2010

2009
Graph homomorphisms, the Tutte polynomial and "q-state Potts uniqueness".
Electron. Notes Discret. Math., 2009

Monochromatic geometric k-factors in red-blue sets with white and Steiner points.
Electron. Notes Discret. Math., 2009

Tutte Uniqueness of Locally Grid Graphs.
Ars Comb., 2009

2007
Homomorphisms and Polynomial Invariants of Graphs.
Electron. Notes Discret. Math., 2007


  Loading...