A. Márquez

Publications
Influence

J. Cáceres, A. Márquez, O. Oellermann, M. L. Puertas
Computer Science, Mathematics
Discret. Math.
1 July 2005

We show that every convex set of vertices in a graph is the convex hull of the collection of its contour vertices. Expand

The difference between the metric dimension and the determining number of a graph

D. Garijo, Antonio González Herrera, A. Márquez
Mathematics, Computer Science
Appl. Math. Comput.
15 December 2014

We study the maximum value of the difference between the metric dimension and the determining number of a graph as a function of its order. Expand

Applied Mathematics and Computation Computing the Tutte polynomial of Archimedean tilings

M. E. Gegúndez, D. Garijo, A. Márquez, M. P. Revuelta, F. Sagols
2014

We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, hexagons and combinations thereof. Our algorithm improves a well known method… Expand

Triangle-Free Planar Graphs and Segment Intersection Graphs

Natalia de Castro, F. J. Cobos, J. C. Dana, A. Márquez, M. Noy
Computer Science, Mathematics
J. Graph Algorithms Appl.
2002

Labeling Subway Lines

Maria Angeles Garrido, C. Iturriaga, A. Márquez, J. Portillo, Pedro Reyes, A. Wolff
Computer Science
ISAAC
24 June 2009

We present algorithms for labeling points on a line with axis-parallel rectangular labels of equal height. Expand

The determining number of Kneser graphs

J. Cáceres, D. Garijo, Antonio González Herrera, A. Márquez, M. L. Puertas
Mathematics, Computer Science
Discret. Math. Theor. Comput. Sci.
28 January 2013

A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. Expand

Compact Grid Representation of Graphs

J. Cáceres, C. Cortés, +7 authors Jesus Valenzuela
Mathematics, Computer Science
EGC
27 June 2011

A graph G is said to be grid locatable if it admits a representation such that vertices are mapped to grid points and edges to line segments that avoid grid points but the extremes. Expand

Geometric Tree Graphs of Points in Convex Position

M. Hernando, F. Hurtado, A. Márquez, M. Mora, M. Noy
Computer Science, Mathematics
Discret. Appl. Math.
15 April 1999

We concentrate on the geometric tree graph of a set of n points in convex position, denoted by Gn, and prove the existence of Hamiltonian cycles and the fact that they have maximum connectivity. Expand

Computational Geometry on Surfaces

C. Grima, A. Márquez
Mathematics
Springer Netherlands
2001

Steiner distance and convexity in graphs

J. Cáceres, A. Márquez, M. L. Puertas
Computer Science, Mathematics
Eur. J. Comb.
1 April 2008

We use the Steiner distance to define a convexity in the vertex set of a graph, which has a nice behavior in the well-known class of HHD-free graphs. Expand

Recommended Authors