Add to ORKGWe 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
AbstractWe prove that any two tilings of a rectangular region by T-tetrominoes are connected by move...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each ...
We define a locally grid graph as a graph in which the structure around each vertex is a 3×3 grid ⊞,...
AbstractWe define a locally grid graph as a graph in which the structure around each vertex is a 3×3...
AbstractA graph G is called T-unique if any other graph having the same Tutte polynomial as G is iso...
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings b...
AbstractWe introduce a new property of graphs called ‘q-state Potts uniqueness’ and relate it to chr...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial...
AbstractWe prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d...
We establish for which weighted graphs H homomorphism functions from multigraphs G to H are special...
AbstractThis paper establishes a relation between the Clar covering polynomial of hexagonal systems ...
We introduce a new property of graphs called ‘q-state Potts unique-ness’ and relate it to chromatic ...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
AbstractWe prove that any two tilings of a rectangular region by T-tetrominoes are connected by move...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....
We give a complete classification of hexagonal tilings and locally C6 graphs, by showing that each ...
We define a locally grid graph as a graph in which the structure around each vertex is a 3×3 grid ⊞,...
AbstractWe define a locally grid graph as a graph in which the structure around each vertex is a 3×3...
AbstractA graph G is called T-unique if any other graph having the same Tutte polynomial as G is iso...
We describe an algorithm to compute the Tutte polynomial of large fragments of Archimedean tilings b...
AbstractWe introduce a new property of graphs called ‘q-state Potts uniqueness’ and relate it to chr...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial...
AbstractWe prove that if a graph H has the same Tutte polynomial as the line graph of a d-regular, d...
We establish for which weighted graphs H homomorphism functions from multigraphs G to H are special...
AbstractThis paper establishes a relation between the Clar covering polynomial of hexagonal systems ...
We introduce a new property of graphs called ‘q-state Potts unique-ness’ and relate it to chromatic ...
AbstractMany polynomials have been defined associated to graphs, like the characteristic, matchings,...
AbstractWe prove that any two tilings of a rectangular region by T-tetrominoes are connected by move...
AbstractA hexagonal system is a connected plane graph without cut vertices in which each interior fa...
This paper initiates a study of the connection between graph homomorphisms and the Tutte polynomial....