AbstractWe 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 classification of locally grid graphs, showing that each of them has a natural embedding in the torus or in the Klein bottle. Secondly, as a continuation of the research initiated in (On graphs determined by their Tutte polynomials, Graphs Combin., to appear), we prove that Cp×Cq is uniquely determined by its Tutte polynomial, for p,q⩾6
A topological graph G is a graph drawn in the plane with vertices represented by points and edges re...
The topological Tverberg theorem states that for any prime power q and continuous map from a (d+ 1)(...
The question of the uniqueness of a certain combinatorial structure has arisen in three contexts: a)...
We define a locally grid graph as a graph in which the structure around each vertex is a 3×3 grid ⊞,...
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each ...
We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined...
AbstractA graph G is called T-unique if any other graph having the same Tutte polynomial as G is iso...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
AbstractIn [2,3], Bollobás and Riordan (2001, 2002) generalized the classical Tutte polynomial to gr...
AbstractWe prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial...
A topological graph G is a graph drawn in the plane with vertices represented by points and edges re...
The topological Tverberg theorem states that for any prime power q and continuous map from a (d+ 1)(...
The question of the uniqueness of a certain combinatorial structure has arisen in three contexts: a)...
We define a locally grid graph as a graph in which the structure around each vertex is a 3×3 grid ⊞,...
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each ...
We develop the necessary machinery in order to prove that hexagonal tilings are uniquely determined...
AbstractA graph G is called T-unique if any other graph having the same Tutte polynomial as G is iso...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
AbstractIn [2,3], Bollobás and Riordan (2001, 2002) generalized the classical Tutte polynomial to gr...
AbstractWe prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d...
AbstractA topological generalization of the uniqueness of duals of 3-connected planar graphs will be...
A central problem in synthetic geometry is the characterisation of graphs and geometries. The local ...
AbstractThis paper initiates a general study of the connection between graph homomorphisms and the T...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial...
A topological graph G is a graph drawn in the plane with vertices represented by points and edges re...
The topological Tverberg theorem states that for any prime power q and continuous map from a (d+ 1)(...
The question of the uniqueness of a certain combinatorial structure has arisen in three contexts: a)...