On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids

DOI10.1017/S0963548305007327zbMath1094.05013OpenAlexW2134815593MaRDI QIDQ5479032

Omer Giménez, Marc Noy

Publication date: 6 July 2006

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548305007327

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (4)

Distributive lattices, polyhedra, and generalized flows ⋮ Diverse collections in matroids and graphs ⋮ Complexity and approximability of the cover polynomial ⋮ Approximately counting bases of bicircular matroids

This page was built for publication: On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids