scientific article; zbMATH DE number 3954942

From MaRDI portal
Publication:3724360





[For the entire collection see Zbl 0587.00006.] There are considered greedoids (E,\({\mathcal F})\) with a rank r such that every set \(X\subseteq E\) where \(0<| X| \leq r\) has the accessibility property. Three examples are given: the component greedoid of a undirected graph, the strongly component greedoid and the cocycle greedoid of a directed graph. Some structural properties of such greedoids are discussed.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3724360)