Search
Now showing items 1-10 of 10
Article
Locally grid graphs: classification and Tutte uniqueness
(2003)
We define a locally grid graph as a graph in which the structure around each vertex is a 3×3 grid ⊞, the canonical examples being the toroidal grids Cp×Cq. The paper contains two main results. First, we give a complete ...
PhD Thesis
Polinomio de tutte de teselaciones regulares
(2004-10-14)
En eta memoria estudiamos diversos aspectos del polinomio de Tutte de una teselación regular. Comenzamos introduciendo algunas definiciones y resultados significativos de Teoría de Grafos. En primer lugar nos centramos ...
Article
Tutte uniqueness of locally grid graphs
(Departamento de Matemáticas CINVESTAV, 2004)
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 research initiated in [4] and [3] we prove that most locally grid graphs are uniquely determined by ...
Presentation
Grafos localmente grid: clasificación y Tutte unicidad
(Alberto Márquez, 2002)
Article
Article
Computing the Tutte polynomial of Archimedean tilings
(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 for computing the Tutte ...
Article
Hexagonal Tilings and Locally C6 Graphs
(Cornell University, 2005)
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each of them has a natural embedding in the torus or in the Klein bottle (see [12]). We also show that locally grid graphs, ...
Presentation
Tutte unicidad: grafos localmente grid y grados localmente C6
(Alberto Márquez, 2002)
Article
Hexagonal Tilings: Tutte Uniqueness
(Cornell University, 2005)
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.
PhD Thesis
Inmersiones de grafos en superficies tubulares de género finito
(1999-02-12)
El matemático alemán Euler (1707-1782) resolvió en 1736 el famoso problema de los puentes de Königsberg. Dicha ciudad estaba divida en cuatro partes, conectadas por siete puentes, al pasar por ella un río (ver Figura ...