We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and ...

Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; ...

We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean distance ...

This work is framed within the eld of Graph Theory, speci cally in the area of graph coloring. Our main objective has ...

We undertake a study on computing Hamiltonian alternating cycles and paths on bicolored point sets. This has been an ...

We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between ...

We study the problem of augmenting the locus N of a plane Euclidean network N by in- serting iteratively a finite set ...

Given a set S of n line segments in the plane, we say that a region R R2 is a stabber for S if R contains exactly one ...

We give a new method of generating strongly polynomial sequences of graphs, i.e., sequences (Hk) indexed by a tuple k = ...

We study the problem of augmenting the locus N of a plane Euclidean network N by inserting iteratively a finite set of ...

Given a bicolored point set S, it is not always possible to construct a monochromatic geometric planar k-factor of S. We ...

This paper deals with the maximum value of the difference between the determining number and the metric dimension of a ...

We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings by squares, triangles, ...

We exhibit explicit constructions of contractors for the graph parameter counting the number of B-flows of a graph, where ...

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

Let S be a set of n points in Rd in general position. A set H of k-flats is called an mk-stabber of S if the relative ...

Let G be a graph embedded in an orientable surface Σ, possibly with edge weights, and denote by len(γ) the length (the ...

We focus on the development of approximated algorithms to find high quality triangulations of minimum dilation because the ...

Sensory evaluation of foods is as important as chemical, physical or microbiological examinations, being specially relevant ...

In this paper we study the problem of finding flock patterns in a set of trajectories of moving entities. A flock refers ...

It is well known that, given n red points and n blue points on a circle, it is not always possible to find a plane geometric ...

Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied ...

In this paper we propose a new GPU method able to compute the 2D constrained Delaunay triangulation of a planar straight ...

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 ...

We present a practical Java tool for simulating synchronized distributed algorithms on sets of 2-and 3-dimensional ...

Although the exact counting and enumeration of polyominoes remain challenging open problems, several positive results were ...

In this paper we propose and solve common influence region queries. We present GPU parallel algorithms, designed under ...

The Minimum Weight Pseudo-Triangulation (MWPT) problem is suspected to be NP-hard. We show here how Simulated Annealing ...

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 ...

This paper deals with three resolving parameters: the metric dimension, the upper dimension and the resolving number. We ...

Let f(n) be a function and L be a graph. Denote by RT(n, L, f(n)) the maximum number of edges of an L-free graph on n ...

A graph is crossing-critical if its crossing number decreases when we remove any of its edges. Recently it was proved that ...

We study a graph parameter related to resolving sets and metric dimension, namely the resolving number, introduced by ...

An intriguing conjecture of Nandakumar and Ramana Rao is that for every convex body K ⊆ R2, and for any positive integer ...

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 ...

Let P and F be sets of n ≥ 2 and m ≥ 2 points in the plane, respectively, so that P∪F is in general position. We study the ...

A triangulation of a surface is irreducible if there is no edge whose contraction produces another triangulation of the ...

Based on some recent modelling considerations in location theory we call for study of three CG constructs of Voronoi type that seem not to have been studied much before.

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.

Abstract Voronoi diagrams are a unifying framework that covers many types of concrete Voronoi diagrams. This talk reports on the state of the art, including recent progress.

A web-based system that determines point/curve and curve/curve bisectors in a dynamic geometry system in a completely ...

A d-dimensional simplex S is called a k-reptile (or a k-reptile simplex) if it can be tiled without overlaps by k simplices ...

A set of vertices SS in a graph GG is a resolving set for GG if, for any two vertices u,vu,v, there exists x∈Sx∈S such ...

In 1926, Jarník introduced the problem of drawing a convex n-gon with vertices having integer coordinates. He constructed ...

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 ...

An orthogonal polygon of P is called “thin” if the dual graph of the partition obtained by extending all edges of P towards ...

In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and ...

In this paper we consider the flip operation for combinatorial pointed pseudo-triangulations where faces have size 3 or ...

The invisibility graph I(X) of a set X ⊆ Rd is a (possibly infinite) graph whose vertices are the points of X and two ...

Given a set P of points in Rd, a convex hole (alternatively, empty convex polytope) of P is a convex polytope with vertices ...

This paper focuses on a variation of the Art Gallery problem that considers open edge guards. The “open” prefix means the ...

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 ...

We introduce a class of solids that can be constructed gluing stackable pieces, which has been proven to have advantages ...

In this paper, we introduce a natural variation of the problem of computing all bichromatic intersections between two sets ...

Given linearly inseparable sets R of red points and B of blue points, we consider several measures of how far they are ...

Let R and B be sets of red and blue points in the plane in general position. We study the problem of computing a k-level ...

The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner ...

We introduce a new property of graphs called ‘q-state Potts unique-ness’ and relate it to chromatic and Tutte uniqueness, ...

We answer a question raised by Lovász and B. Szegedy [Contractors and connectors in graph algebras, J. Graph Theory 60:1 ...

This paper initiates a study on the problem of computing the difference between the metric dimension and the determining ...

We establish for which weighted graphs H homomorphism functions from multigraphs G to H are specializations of the Tutte ...

We study the existence of monochromatic planar geometric k-factors on sets of red and blue points. When it is not possible ...

This paper initiates a general study of the connection between graph homomorphisms and the Tutte polynomial. This connection ...

En este trabajo estudiamos el problema de determinar si dos conjuntos disjuntos de n puntos en el plano son separables ...

This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial. This connection enables ...

Consideramos una colección de puntos bicromática y nos preguntamos cuántos puntos adicionales son necesarios considerar ...

We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural ...

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.

En eta memoria estudiamos diversos aspectos del polinomio de Tutte de una teselación regular. Comenzamos introduciendo ...

A graph is said to be locally grid if the structure around each of its vertices is a 3 × 3 grid. As a follow up of the ...