Counting 2-connected deletion-minors of binary matroids
type: Item
instance of: scholarly article
title: Counting 2-connected deletion-minors of binary matroids
zbMATH Open document ID: 1277.05037
author: Bill Jackson
published in: Discrete Mathematics
publication date: 2013-12-02T00:00:00Z
Mathematics Subject Classification ID: 05B35
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 6235115
zbMATH Keywords: binary matroid
zbMATH Keywords: 2-connected minor
zbMATH Keywords: characteristic polynomial
MaRDI profile type: Publication
full work available at URL: j.disc.2012.11.003
OpenAlex ID: W1981245899
cites work: On finding a cycle basis with a shortest maximal cycle
cites work: On finding cycle bases and fundamental cycle bases with a shortest maximal cycle
cites work: A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph
cites work: Maxmaxflow and counting subgraphs
cites work: Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
cites work: Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions
cites work: Q3416249
cites work: Lectures on matroids
cites work: The intractability of computing the minimum distance of a code
DOI: 10.1016/J.DISC.2012.11.003
description: scientific article; zbMATH DE number 6235115