Separating cocircuits in binary matroids

DOI10.1016/0024-3795(82)90244-0MaRDI QIDQ1165248zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3719168 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• A Combinatorial Decomposition Theory
• A Generalization of a Theorem of Sylvester on the Lines Determined by a Finite Point Set.
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Chords and disjoint paths in matroids
• Converting Linear Programs to Network Problems
• Decomposition of regular matroids
• From Matrices to Graphs
• Lectures on matroids
• On even matroids
• Recognizing graphic matroids

Cited in

(7)

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

This page was built for publication: Separating cocircuits in binary matroids

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