On bipartite restrictions of binary matroids
type: Item
instance of: scholarly article
title: On bipartite restrictions of binary matroids
zbMATH Open document ID: 1229.05081
published in: European Journal of Combinatorics
publication date: 2011-11-29T00:00:00Z
Mathematics Subject Classification ID: 05B35
zbMATH DE Number: 5982467
zbMATH Keywords: loopless binary matroid
author: James Oxley
MaRDI profile type: Publication
full work available at URL: j.ejc.2011.04.005
OpenAlex ID: W2081429117
cites work: Q3320411
cites work: A note on the critical problem for matroids
cites work: Shortest coverings of graphs with cycles
cites work: Q4012032
cites work: Q5619114
cites work: Some Extremal Properties of Bipartite Subgraphs
cites work: On some extremal problems in graph theory
cites work: The size of the largest bipartite subgraphs
cites work: Q5390304
cites work: Nowhere-zero 6-flows
cites work: A Contribution to the Theory of Chromatic Polynomials
cites work: Euler and bipartite matroids
DOI: 10.1016/J.EJC.2011.04.005
description: scientific article; zbMATH DE number 5982467