Counting 2-connected deletion-minors of binary matroids

DOI10.1016/J.DISC.2012.11.003zbMath1277.05037OpenAlexW1981245899MaRDI QIDQ385399

Bill Jackson

Publication date: 2 December 2013

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2012.11.003

zbMATH Keywords

characteristic polynomialbinary matroid2-connected minor

Mathematics Subject Classification ID

Paths and cycles (05C38) Combinatorial aspects of matroids and geometric lattices (05B35) Graph minors (05C83)

Cites Work

• Unnamed Item
• Maxmaxflow and counting subgraphs
• On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
• On finding a cycle basis with a shortest maximal cycle
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• The intractability of computing the minimum distance of a code
• Lectures on matroids

This page was built for publication: Counting 2-connected deletion-minors of binary matroids