AbstractIn previous papers we have mainly studied greedoids with the interval property. This paper exhibits 11 classes of greedoids whose members do not necessarily have the interval property. These non-interval greedoids are related to some fundamental algorithms and procedural principles like Gaussian elimination, blossom trees, series-parallel decomposition, ear decomposition, retracting and dismantling. We introduce some weaker exchange properties. One of them can be shown to be equivalent to the greedoid exchange property. Another one leads to the definition of transposition greedoids. Besides all interval greedoids, some non-interval greedoids share the transposition property
AbstractLet pn denote the maximum number of paths a greedoid over n elements can have. As an upper b...
We define the root polytope of a regular oriented matroid, and show that the greedoid polynomial of ...
Similarities and differences between matroids (abstract dependence systems) and antimatroids (abstra...
AbstractIn previous papers we have mainly studied greedoids with the interval property. This paper e...
AbstractIn a natural way, a new class of set system is defined in terms of transversals of a family ...
AbstractVarious types of greedoids have been studied in relation to the Greedy Algorithm and therefo...
AbstractAn exchange system is a system of feasible subsets of a finite set E which is accessible (gu...
AbstractUndirected branching greedoids are defined by rooted trees of a graph. We give a minor crite...
AbstractThe two variable greedoid Tutte polynomialf(G;t,z), which was introduced in previous work of...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
AbstractThis paper discusses polymatroid greedoids, a superclass of them, called local poset greedoi...
AbstractLet (V, D) be an directed graph and P0ϵV. Define F := {X ⊆ D: X is a branching rooted at P0}...
AbstractCharacteristic structural properties are established for those greedoids where the greedy al...
AbstractIn 1959 Tutte [5] gave a minor characterization of graphic matroids. Within the framework of...
AbstractTwo combinatorial structures which describe the branchings in a graph are graphic matroids a...
AbstractLet pn denote the maximum number of paths a greedoid over n elements can have. As an upper b...
We define the root polytope of a regular oriented matroid, and show that the greedoid polynomial of ...
Similarities and differences between matroids (abstract dependence systems) and antimatroids (abstra...
AbstractIn previous papers we have mainly studied greedoids with the interval property. This paper e...
AbstractIn a natural way, a new class of set system is defined in terms of transversals of a family ...
AbstractVarious types of greedoids have been studied in relation to the Greedy Algorithm and therefo...
AbstractAn exchange system is a system of feasible subsets of a finite set E which is accessible (gu...
AbstractUndirected branching greedoids are defined by rooted trees of a graph. We give a minor crite...
AbstractThe two variable greedoid Tutte polynomialf(G;t,z), which was introduced in previous work of...
AbstractAntimatroids are combinatorial structures abstracting some properties of convexity, and in a...
AbstractThis paper discusses polymatroid greedoids, a superclass of them, called local poset greedoi...
AbstractLet (V, D) be an directed graph and P0ϵV. Define F := {X ⊆ D: X is a branching rooted at P0}...
AbstractCharacteristic structural properties are established for those greedoids where the greedy al...
AbstractIn 1959 Tutte [5] gave a minor characterization of graphic matroids. Within the framework of...
AbstractTwo combinatorial structures which describe the branchings in a graph are graphic matroids a...
AbstractLet pn denote the maximum number of paths a greedoid over n elements can have. As an upper b...
We define the root polytope of a regular oriented matroid, and show that the greedoid polynomial of ...
Similarities and differences between matroids (abstract dependence systems) and antimatroids (abstra...