On bipartite restrictions of binary matroids

DOI10.1016/J.EJC.2011.04.005zbMath1229.05081OpenAlexW2081429117MaRDI QIDQ648977

James G. Oxley

Publication date: 29 November 2011

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.04.005

zbMATH Keywords

loopless binary matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on the critical problem for matroids
• Shortest coverings of graphs with cycles
• Nowhere-zero 6-flows
• The size of the largest bipartite subgraphs
• On some extremal problems in graph theory
• Euler and bipartite matroids
• Some Extremal Properties of Bipartite Subgraphs
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: On bipartite restrictions of binary matroids