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 |