Bicycle dimension and special points of the Tutte polynomial
From MaRDI portal
Publication:1569033
DOI10.1006/jctb.1998.1860zbMath1023.05030OpenAlexW2007638269MaRDI QIDQ1569033
Publication date: 25 June 2000
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1998.1860
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (10)
On the evaluation at \((j,j^2)\) of the Tutte polynomial of a ternary matroid ⋮ Parameterized counting of trees, forests and matroid bases ⋮ Interlace polynomials for multimatroids and delta-matroids ⋮ Parameterized Counting and Cayley Graph Expanders ⋮ Diverse collections in matroids and graphs ⋮ On the evaluation at \(( - \iota ,\iota )\) of the Tutte polynomial of a binary matroid ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ Some open problems on excluding a uniform matroid ⋮ MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS ⋮ The complexity of computing the Tutte polynomial on transversal matroids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matroid representation over GF(3)
- On Reid's characterization of the ternary matroids
- The excluded minors for GF(4)-representable matroids
- On the excluded minors for quaternary matroids
- The Tutte polynomial
- The Tutte Polynomial Part I: General Theory
- Tutte Polynomials and Bicycle Dimension of Ternary Matroids
- The Complexity of Enumeration and Reliability Problems
- Weight Enumeration and the Geometry of Linear Codes
- On the computational complexity of the Jones and Tutte polynomials
- A Decomposition for Combinatorial Geometries
This page was built for publication: Bicycle dimension and special points of the Tutte polynomial