Decomposition of binary signed-graphic matroids
From MaRDI portal
Abstract: In this paper we employ Tutte's theory of bridges to derive a decomposition theorem for binary matroids arising from signed graphs. The proposed decomposition differs from previous decomposition results on matroids that have appeared in the literature in the sense that it is not based on -sums, but rather on the operation of deletion of a cocircuit. Specifically, it is shown that certain minors resulting from the deletion of a cocircuit of a binary matroid will be graphic matroids apart from exactly one that will be signed-graphic, if and only if the matroid is signed-graphic.
Recommendations
Cited in
(12)- Decomposition of binary matroids
- Binary signed-graphic matroids: representations and recognition algorithms
- Signed-graphic matroids with all-graphic cocircuits
- A Tutte decomposition for matrices and bimatroids
- On characterizing the class of cographic signed-graphic matroids
- Rank decompositions and signed bigraphs
- Regular matroid decomposition via signed graphs
- Recognition algorithms for binary signed-graphic matroids
- On the basis pair graphs of signed-graphic matroids
- Decomposition of quaternary signed-graphic matroids
- A mathematical programming approach for recognizing binet matrices
- Symplectic spaces and ear-decomposition of matroids
This page was built for publication: Decomposition of binary signed-graphic matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2848529)