The Tutte polynomial of a morphism of matroids. IV: Computational complexity

DOI10.4171/PM/1788zbMath1137.05019MaRDI QIDQ2474788

Michel Las Vergnas

Publication date: 6 March 2008

Published in: Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

zbMATH Keywords

complexitymatroidTutte polynomialquotientbinaryknot polynomialmatroid perspectivestrong mapeasy point

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (5)

A parity result of Fraysseix, computational complexity of Tutte polynomials, and a conjecture on planar graphs ⋮ Logarithmic concavity for morphisms of matroids ⋮ The Las Vergnas polynomial for embedded graphs ⋮ \(K\)-theoretic Tutte polynomials of morphisms of matroids ⋮ The Tutte polynomial of a morphism of matroids. V: Derivatives as generating functions of Tutte activities

Cites Work

• Unnamed Item
• Unnamed Item
• On the evaluation at \((j,j^2)\) of the Tutte polynomial of a ternary matroid
• Acyclic and totally cyclic orientations of combinatorial geometries
• The Tutte polynomial of a morphism of matroids. I: Set-pointed matroids and matroid perspectives
• The Tutte polynomial of a morphism of matroids. III: Vectorial matroids
• A linking polynomial of two matroids
• The Tutte polynomial of a ported matroid
• On the Tutte Polynomial of a Morphism of Matroids
• On the computational complexity of the Jones and Tutte polynomials
• A Decomposition for Combinatorial Geometries

This page was built for publication: The Tutte polynomial of a morphism of matroids. IV: Computational complexity