Counting 2-connected deletion-minors of binary matroids

DOI10.1016/J.DISC.2012.11.003MaRDI QIDQ385399zbMATH OpenOpenAlexFDO

Authors 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

2-connected minorbinary matroidcharacteristic polynomial

Mathematics Subject Classification ID

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

Recommendations

• On minor-minimally-connected matroids
• scientific article; zbMATH DE number 4093474
• Bounding the beta invariant of 3-connected matroids
• A characterization of a class of non-binary matroids
• On packing minors into connected matroids

Cites work

• A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
• Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
• Lectures on matroids
• Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
• Maxmaxflow and counting subgraphs
• On finding a cycle basis with a shortest maximal cycle
• On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
• The intractability of computing the minimum distance of a code
• The multivariate Tutte polynomial (alias Potts model) for graphs and matroids

Cited in

(1)

• Bounding the beta invariant of 3-connected matroids

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

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