BIPARTITIONS OF HIGHLY CONNECTED TOURNAMENTS
We show that if T is a strongly 10(9)k(6) log(2k)-connected tournament, there exists a partition A, B of V (T) such that each of T[A], T[B], and T[A, B] is strongly k-connected. This provides solutions to tournament analogues of two partition conjectures of Thomassen regarding highly connected graphs. We also discuss spanning linkages as well as nonseparating subdivisions in highly connected tournaments.
- Publisher
- SIAM PUBLICATIONS
- Issue Date
- 2016
- Language
- English
- Article Type
- Article
- Citation
SIAM JOURNAL ON DISCRETE MATHEMATICS, v.30, no.2, pp.895 - 911
- ISSN
- 0895-4801
- Appears in Collection
- MA-Journal Papers(저널논문)
- Files in This Item
- There are no files associated with this item.
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 5 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.