Parametrized Tutte polynomials of graphs and matroids

DSpace/Manakin Repository

Parametrized Tutte polynomials of graphs and matroids

Show simple item record


dc.contributor.author Ellis-Monaghan, J. A.
dc.contributor.author Traldi, Lorenzo
dc.date.accessioned 2010-04-21T20:28:17Z
dc.date.available 2010-04-21T20:28:17Z
dc.date.issued 2006
dc.identifier.citation Ellis-Monaghan, J. A. and L. Traldi. (2006) "Parametrized Tutte polynomials of graphs and matroids." Combinatorics, Probability and Computing 15: 835–854. en_US
dc.identifier.uri http://hdl.handle.net/10385/651
dc.description.abstract We generalize and unify results on parametrized and coloured Tutte polynomials of graphs and matroids due to Zaslavsky, and Bollobas and Riordan. We give a generalized Zaslavsky-Bollobas-Riordan theorem that characterizes parametrized contraction-deletion functions on minor-closed classes of matroids, as well as the modifications necessary to apply the discussion to classes of graphs. In general, these parametrized Tutte polynomials do not satisfy analogues of all the familiar properties of the classical Tutte polynomial. We give conditions under which they do satisfy corank-nullity formulas, and also conditions under which they reflect the structure of series-parallel connections. en_US
dc.publisher Combinatorics, Probability and Computing en_US
dc.title Parametrized Tutte polynomials of graphs and matroids en_US
dc.type Article en_US
dc.identifier.doi 10.1017/S0963548306007656

Files in this item

Files Size Format View
Traldi-Combinat ... ndComputing-vol15-2006.pdf 188.1Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search LDR


Advanced Search

Browse

My Account