Evaluating the Rank Generating Function of a Graphic 2-Polymatroid

DOI10.1017/S0963548305007285MaRDI QIDQ5479035zbMATH OpenOpenAlexFDO

Authors Steven D. Noble

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/s0963548305007285

zbMATH Keywords

\(k\)-thickeningcomplexity

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Complexity of graph polynomials
• The computational complexity of knot and matroid polynomials
• Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
• On the Complexity of the Interlace Polynomial
• scientific article; zbMATH DE number 475578

Cited in

(1)

• The complexity of the greedoid Tutte polynomial

This page was built for publication: Evaluating the Rank Generating Function of a Graphic 2-Polymatroid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5479035)