A characterization of undirected branching greedoids (Q1103626)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4053636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of undirected branching greedoids |
scientific article; zbMATH DE number 4053636 |
Statements
A characterization of undirected branching greedoids (English)
0 references
1988
0 references
Greedoids may be considered as a generalization of matroid theory. In the latter many properties are characterized by excluded minors. Here a class of greedoids, defined by trees of a graph rooted at a fixed vertex, are characterized as interval greedoids not containing four given minors.
0 references
Greedoids
0 references
excluded minors
0 references
trees
0 references
0.8760946393013
0 references
0.850724995136261
0 references
0.8372123837471008
0 references
0.8365262150764465
0 references
