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

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

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

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