Add to ORKGSIGLECNRS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
Using two related parameters, ζ and γ, we extend the recursion for computing the Tutte polynomial of...
We give a simple and practical algorithm to compute the link polynomials, which are defined accordin...
We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel conn...
Available from British Library Document Supply Centre- DSC:DN063055 / BLDSC - British Library Docume...
SIGLECNRS T Bordereau / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
This chapter covers the U-, W-, V- and strong U-polynomials, generalizations of the Tutte polynomial...
The problem of computing the Tutte polynomial of a graph has been a hot topic in recent years, becau...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
AbstractThis paper describes how I became acquainted with the Tutte polynomial, and how I was led to...
SIGLECNRS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
International audienceMany combinatorial and topological invariants of a hyperplane arrangement can ...
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
The Tutte polynomial of a graph or a matroid is a polynomial in two variables x, y, and is of centra...
Using two related parameters, ζ and γ, we extend the recursion for computing the Tutte polynomial of...
We give a simple and practical algorithm to compute the link polynomials, which are defined accordin...
We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel conn...
Available from British Library Document Supply Centre- DSC:DN063055 / BLDSC - British Library Docume...
SIGLECNRS T Bordereau / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
SIGLEAvailable from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-2410...
This chapter covers the U-, W-, V- and strong U-polynomials, generalizations of the Tutte polynomial...
The problem of computing the Tutte polynomial of a graph has been a hot topic in recent years, becau...
The Tutte polynomial is an important tool in graph theory. This paper provides an introduction to th...
AbstractThis paper describes how I became acquainted with the Tutte polynomial, and how I was led to...
SIGLECNRS 17660 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc
AbstractWe prove several theorems concerning Tutte polynomials T(G,x,y) for recursive families of gr...
International audienceMany combinatorial and topological invariants of a hyperplane arrangement can ...
We follow the example of Tutte in his construction of the dichromate of a graph (i.e. the Tutte poly...
The Tutte polynomial of a graph or a matroid is a polynomial in two variables x, y, and is of centra...
Using two related parameters, ζ and γ, we extend the recursion for computing the Tutte polynomial of...
We give a simple and practical algorithm to compute the link polynomials, which are defined accordin...
We use weighted characteristic polynomials to compute Tutte polynomials of generalized parallel conn...