AbstractA matroid M over a set E of elements is semiseparated by a partition {S1, S2} of E iff rank E = rank S1 + rank S2 + 1. Such a semiseparation defines in each Si a pair of matroids or patroid Pi = (Mi, mi); the two patroids P1, P2 weld to form M. The operations of removing and contracting a non-degenerate element of a matroid produce a patroid. The properties of patroids, their bases, and circuits are discussed
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
Abstract. In this paper, we propose a new type of matroids, namely covering matroids, and investigat...
AbstractAs is well known, the cycles of any given graph G may be regarded as the circuits of a matro...
The $es$-splitting operation on binary bridge-less matroids never produces an Eulerian matroid. But ...
AbstractBased only on the knowledge of the values of the rank function two procedures are given to c...
Matroids over tracts (Baker and Bowler, 2017) provide an algebraic framework simultaneously generali...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
Abstract. The way circuits, relative to a basis, are affected as a result of exchanging a basis elem...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
AbstractTwo edges of a graph are said to form a couple when their nodes can be labelled A, B, C, D s...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
AbstractKishi and Kajitani introduced the concepts of the principal partition of a graph and maximal...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
Abstract. In this paper, we propose a new type of matroids, namely covering matroids, and investigat...
AbstractAs is well known, the cycles of any given graph G may be regarded as the circuits of a matro...
The $es$-splitting operation on binary bridge-less matroids never produces an Eulerian matroid. But ...
AbstractBased only on the knowledge of the values of the rank function two procedures are given to c...
Matroids over tracts (Baker and Bowler, 2017) provide an algebraic framework simultaneously generali...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
Abstract. The way circuits, relative to a basis, are affected as a result of exchanging a basis elem...
Abstract. Matroids were introduced by Whitney in 1935 to try to capture abstractly the essence of de...
Matroids have been defined in 1935 as generalization of graphs and matrices. Starting from the 1950s...
AbstractTwo edges of a graph are said to form a couple when their nodes can be labelled A, B, C, D s...
We consider different ways of describing a matroid to a Turing machine by listing the members of var...
AbstractA new matroid decomposition with several attractive properties leads to a new theorem of alt...
AbstractKishi and Kajitani introduced the concepts of the principal partition of a graph and maximal...
AbstractSeveral graph-theoretic notions applied to matroid basis graphs in the preceding paper are n...
AbstractThe concept of a circuit basis for a matroid is introduced, as an algorithmically rapid way ...
Abstract. In this paper, we propose a new type of matroids, namely covering matroids, and investigat...
AbstractAs is well known, the cycles of any given graph G may be regarded as the circuits of a matro...
DOI
Add to ORKG