AbstractTwo decomposition theorems of Part I are utilized to characterize minimal violation matroids of matroid properties that possess certain composition and extension properties. Graphicness, planarity, and regularity have all or almost all of the desired composition and extension properties, and rather simple arguments produce the well-known minimal violation matroids
Matroids over tracts (Baker and Bowler, 2017) provide an algebraic framework simultaneously generali...
A transversal matroid MM can be represented by a collection of sets, called a presentation of MM, wh...
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decompositio...
AbstractTwo decomposition theorems of Part I are utilized to characterize minimal violation matroids...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
AbstractWe introduce a new class of binary matroids called almost regular. Any such matroid is not r...
AbstractIt is proved that every regular matroid may be constructed by piecing together graphic and c...
AbstractWe identify sufficient conditions under which a decomposable graph N induces a decomposition...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
Seymour’s decomposition theorem [J. Combin. Theory Ser. B, 28 (1980), pp. 305– 359] for regular matr...
Matroids were first defined in 1935 as an abstract generalization of graphs and matrices. In the sub...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
AbstractWe give a decomposition theorem for signed graphs whose frame matroids are binary and a deco...
Matroids over tracts (Baker and Bowler, 2017) provide an algebraic framework simultaneously generali...
A transversal matroid MM can be represented by a collection of sets, called a presentation of MM, wh...
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decompositio...
AbstractTwo decomposition theorems of Part I are utilized to characterize minimal violation matroids...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
AbstractWe introduce a new class of binary matroids called almost regular. Any such matroid is not r...
AbstractIt is proved that every regular matroid may be constructed by piecing together graphic and c...
AbstractWe identify sufficient conditions under which a decomposable graph N induces a decomposition...
This paper is based on the element splitting operation for binary matroids that was introduced by Az...
Seymour’s decomposition theorem [J. Combin. Theory Ser. B, 28 (1980), pp. 305– 359] for regular matr...
Matroids were first defined in 1935 as an abstract generalization of graphs and matrices. In the sub...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
AbstractWe give a decomposition theorem for signed graphs whose frame matroids are binary and a deco...
Matroids over tracts (Baker and Bowler, 2017) provide an algebraic framework simultaneously generali...
A transversal matroid MM can be represented by a collection of sets, called a presentation of MM, wh...
We give a decomposition theorem for signed graphs whose frame matroids are binary and a decompositio...
DOI
Add to ORKG