Separating cocircuits in binary matroids

DOI10.1016/0024-3795(82)90244-0zbMath0487.05015OpenAlexW2058769292MaRDI QIDQ1165248

William H. Cunningham

Publication date: 1982

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(82)90244-0

zbMATH Keywords

bond matroidgraph realizabilityFano minor

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Algorithms in computer science (68W99)

Related Items

Short cocircuits in binary matroids ⋮ Signed-graphic matroids with all-graphic cocircuits ⋮ Binary signed-graphic matroids: representations and recognition algorithms ⋮ A decomposition theory for matroids. VII: Analysis of minimal violation matrices ⋮ On Mighton's characterization of graphic matroids ⋮ Computational implementation of Fujishige's graph realizability algorithm ⋮ Nonseparating Cocircuits in Binary Matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Decomposition of regular matroids
• Recognizing graphic matroids
• Chords and disjoint paths in matroids
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• A Combinatorial Decomposition Theory
• Converting Linear Programs to Network Problems
• From Matrices to Graphs
• Lectures on matroids
• A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.
• On even matroids