Bicycle dimension and special points of the Tutte polynomial

DOI10.1006/JCTB.1998.1860MaRDI QIDQ1569033zbMATH OpenOpenAlexFDO

Authors Dirk Vertigan

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

zbMATH Keywords

matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
• Tutte Polynomials and Bicycle Dimension of Ternary Matroids
• Tutte polynomials computable in polynomial time
• The exact complexity of the Tutte polynomial
• The Tutte polynomial of a morphism of matroids. IV: Computational complexity

Cites work

• A Decomposition for Combinatorial Geometries
• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 437298 (Why is no real title available?)
• scientific article; zbMATH DE number 3133252 (Why is no real title available?)
• scientific article; zbMATH DE number 3598496 (Why is no real title available?)
• scientific article; zbMATH DE number 3049182 (Why is no real title available?)
• Matroid representation over GF(3)
• On Reid's characterization of the ternary matroids
• On the computational complexity of the Jones and Tutte polynomials
• On the excluded minors for quaternary matroids
• The Complexity of Enumeration and Reliability Problems
• The excluded minors for GF(4)-representable matroids
• The Tutte polynomial
• The Tutte polynomial. I: General theory
• Tutte Polynomials and Bicycle Dimension of Ternary Matroids
• Weight Enumeration and the Geometry of Linear Codes

Cited in

(15)

• The complexity of computing the Tutte polynomial on transversal matroids
• Parameterized counting of trees, forests and matroid bases
• On the evaluation at ( - , ) of the Tutte polynomial of a binary matroid
• MULTI-TERMINAL NETWORK CONNECTEDNESS ON SERIES-PARALLEL NETWORKS
• Tutte Polynomials and Bicycle Dimension of Ternary Matroids
• Interlace polynomials for multimatroids and delta-matroids
• On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids
• Parameterized Counting and Cayley Graph Expanders
• Diverse collections in matroids and graphs
• Orienting transversals and transition polynomials of multimatroids
• The complexity of the greedoid Tutte polynomial
• Diverse collections in matroids and graphs
• Detecting and counting small subgraphs, and evaluating a parameterized Tutte polynomial: lower bounds via toroidal grids and Cayley graph expanders
• On the evaluation at \((j,j^2)\) of the Tutte polynomial of a ternary matroid
• Some open problems on excluding a uniform matroid

This page was built for publication: Bicycle dimension and special points of the Tutte polynomial

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