Abstract
A result of Korte and Lovász states that the basis graph of every 2- connected greedoid is connected. We prove that the basis graph of every 3-connected branching greedoid is ( -- 1)-connected, where is the minimum in-degree (disregarding the root) of the underlying rooted directed (multi) graph. We also give examples showing that this results is (in some sense) best possible.
| Original language | English |
|---|---|
| Pages (from-to) | 233-237 |
| Number of pages | 5 |
| Journal | Journal of graph theory |
| Volume | 16 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1992 |
Keywords
- METIS-140357
- IR-70971
Fingerprint Dive into the research topics of 'The connectivity of the basis graph of a branching greedoid'. Together they form a unique fingerprint.
Cite this
Broersma, H. J., Li, X., & Li, X. (1992). The connectivity of the basis graph of a branching greedoid. Journal of graph theory, 16(3), 233-237. https://doi.org/10.1002/jgt.3190160306