Add to ORKG14 pagesThe Tutte polynomial is a powerfull analytic tool to study the structure of planar graphs. In this paper, we establish some relations between the number of clusters per bond for planar graph and its dual : these relations bring into play the coordination number of the graphs. The factorial moment measure of the number of clusters per bond are given using the derivative of the Tutte polynomial. Examples are presented for simple planar graph. The cases of square, triangular, honeycomb, Archimedean and Laves lattices are discussed
Given any graph G, there is a bivariate polynomial called Tutte polynomial which can be derived from...
This thesis deals with the Tutte polynomial, studied from different points of view. In the first par...
AbstractIn this note, we prove a structural theorem for planar graphs, namely that every planar grap...
AbstractWe give a combinatorial interpretation of the evaluation at (3, 3) of the Tutte polynomial o...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.Includes bibliograp...
Networks are used to model many real-world systems, including molecules, transportation systems, soc...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
The problem of computing the Tutte polynomial of a graph has been a hot topic in recent years, becau...
Cette thèse porte sur le polynôme de Tutte, étudié selon différents points de vue. Dans une première...
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that ea...
The identity linking the Tutte polynomial with the Potts model on a graph implies the existence of a...
AbstractWe show that the number of chains of given length in a graph G can be easily found from the ...
AbstractThe Martin polynomial of an oriented Eulerian graph encodes information about families of cy...
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
Given any graph G, there is a bivariate polynomial called Tutte polynomial which can be derived from...
This thesis deals with the Tutte polynomial, studied from different points of view. In the first par...
AbstractIn this note, we prove a structural theorem for planar graphs, namely that every planar grap...
AbstractWe give a combinatorial interpretation of the evaluation at (3, 3) of the Tutte polynomial o...
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2007.Includes bibliograp...
Networks are used to model many real-world systems, including molecules, transportation systems, soc...
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
The problem of computing the Tutte polynomial of a graph has been a hot topic in recent years, becau...
Cette thèse porte sur le polynôme de Tutte, étudié selon différents points de vue. Dans une première...
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that ea...
The identity linking the Tutte polynomial with the Potts model on a graph implies the existence of a...
AbstractWe show that the number of chains of given length in a graph G can be easily found from the ...
AbstractThe Martin polynomial of an oriented Eulerian graph encodes information about families of cy...
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
Given any graph G, there is a bivariate polynomial called Tutte polynomial which can be derived from...
This thesis deals with the Tutte polynomial, studied from different points of view. In the first par...
AbstractIn this note, we prove a structural theorem for planar graphs, namely that every planar grap...