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.

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

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

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

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

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

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

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.

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

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