Abstract
| 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 |
Fingerprint
Keywords
- METIS-140357
- IR-70971
Cite this
}
The connectivity of the basis graph of a branching greedoid. / Broersma, Haitze J.; Li, Xueliang; Li, Xueliang.
In: Journal of graph theory, Vol. 16, No. 3, 1992, p. 233-237.Research output: Contribution to journal › Article › Academic › peer-review
TY - JOUR
T1 - The connectivity of the basis graph of a branching greedoid
AU - Broersma, Haitze J.
AU - Li, Xueliang
AU - Li, Xueliang
PY - 1992
Y1 - 1992
N2 - 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.
AB - 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.
KW - METIS-140357
KW - IR-70971
U2 - 10.1002/jgt.3190160306
DO - 10.1002/jgt.3190160306
M3 - Article
VL - 16
SP - 233
EP - 237
JO - Journal of graph theory
JF - Journal of graph theory
SN - 0364-9024
IS - 3
ER -