Back to University of Twente portal
The connectivity of the basis graph of a branching greedoid
Broersma, H.J. and Li, Xueliang (1992) The connectivity of the basis graph of a branching greedoid. Journal of Graph Theory, 16 (3). pp. 233-237. ISSN 0364-9024
![[img]](http://doc.utwente.nl/style/images/fileicons/application_pdf.png)
| PDF 259Kb |
| 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. |
| Item Type: | Article |
| Copyright: | © 1992 Wiley InterScience |
| Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |
| Research Group: | |
| Link to this item: | http://purl.utwente.nl/publications/70971 |
| Official URL: | http://dx.doi.org/10.1002/jgt.3190160306 |
| Export this item as: | BibTeX EndNote HTML Citation Reference Manager |
Show download statistics for this publication
Show download statistics for this publicationRepository Staff Only: item control page
Metis ID: 140357