DOIAbstract
AbstractUsing an earlier characterization of simplicial hypergraphs we obtain a characterization of binary simplicial matroids in terms of the existence of a special base
AbstractUsing an earlier characterization of simplicial hypergraphs we obtain a characterization of binary simplicial matroids in terms of the existence of a special base
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
Slater introduced the point-addition operation on graphs to characterize 4-connected graphs. The Г-e...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractUsing an earlier characterization of simplicial hypergraphs we obtain a characterization of ...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M...
AbstractShort proofs are presented for two results due respectively to Tutte and Welsh
Short proofs are presented for two results due respectively to Tutte and Welsh. © 1981.SCOPUS: ar.ji...
AbstractWe give a necessary and sufficient condition for a binary matroid to be graphic. The conditi...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractLet (ks) denote the set of all k-element-subsets of a finite set S. A k-simplical matroid on...
AbstractIn Discrete Math. 184 (1998) 267, the authors extended the splitting operation of graphs to ...
This note gives a characterization of binary geometries by means of a double elimination axiom which...
AbstractIt is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Mat...
It is proved that a binary matroid has only binary adjoints if and only if it is either nonregular o...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
Slater introduced the point-addition operation on graphs to characterize 4-connected graphs. The Г-e...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
AbstractUsing an earlier characterization of simplicial hypergraphs we obtain a characterization of ...
AbstractIn an earlier paper we defined a class of matroids whose circuit are combinatorial generaliz...
Let M be a simple matroid (= combinatorial geometry). On the bases of M we consider two matroids S(M...
AbstractShort proofs are presented for two results due respectively to Tutte and Welsh
Short proofs are presented for two results due respectively to Tutte and Welsh. © 1981.SCOPUS: ar.ji...
AbstractWe give a necessary and sufficient condition for a binary matroid to be graphic. The conditi...
AbstractA matroid may be characterized by the collection of its bases or by the collection of its ci...
AbstractLet (ks) denote the set of all k-element-subsets of a finite set S. A k-simplical matroid on...
AbstractIn Discrete Math. 184 (1998) 267, the authors extended the splitting operation of graphs to ...
This note gives a characterization of binary geometries by means of a double elimination axiom which...
AbstractIt is a well-known result of Tutte, A homotopy theorem for matroids, I, II, Trans. Amer. Mat...
It is proved that a binary matroid has only binary adjoints if and only if it is either nonregular o...
AbstractThe bases and the cocircuits of a matroid form a blocking pair of clutters; this fact leads ...
Slater introduced the point-addition operation on graphs to characterize 4-connected graphs. The Г-e...
AbstractIt is shown that a simple binary matroid is already uniquely determined by its family of clo...
Add to ORKG