BIPARTITIONS OF HIGHLY CONNECTED TOURNAMENTS
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Kim, Jaehoon | ko |
| dc.contributor.author | Kuhn, Daniela | ko |
| dc.contributor.author | Osthus, Deryk | ko |
| dc.date.accessioned | 2019-07-18T05:34:21Z | - |
| dc.date.available | 2019-07-18T05:34:21Z | - |
| dc.date.created | 2019-07-17 | - |
| dc.date.created | 2019-07-17 | - |
| dc.date.created | 2019-07-17 | - |
| dc.date.issued | 2016 | - |
| dc.identifier.citation | SIAM JOURNAL ON DISCRETE MATHEMATICS, v.30, no.2, pp.895 - 911 | - |
| dc.identifier.issn | 0895-4801 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/263348 | - |
| dc.description.abstract | 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. | - |
| dc.language | English | - |
| dc.publisher | SIAM PUBLICATIONS | - |
| dc.title | BIPARTITIONS OF HIGHLY CONNECTED TOURNAMENTS | - |
| dc.type | Article | - |
| dc.identifier.wosid | 000385015100013 | - |
| dc.identifier.scopusid | 2-s2.0-84976878508 | - |
| dc.type.rims | ART | - |
| dc.citation.volume | 30 | - |
| dc.citation.issue | 2 | - |
| dc.citation.beginningpage | 895 | - |
| dc.citation.endingpage | 911 | - |
| dc.citation.publicationname | SIAM JOURNAL ON DISCRETE MATHEMATICS | - |
| dc.identifier.doi | 10.1137/15M1006611 | - |
| dc.contributor.localauthor | Kim, Jaehoon | - |
| dc.contributor.nonIdAuthor | Kuhn, Daniela | - |
| dc.contributor.nonIdAuthor | Osthus, Deryk | - |
| dc.description.isOpenAccess | N | - |
| dc.type.journalArticle | Article | - |
| dc.subject.keywordAuthor | connectivity | - |
| dc.subject.keywordAuthor | tournament | - |
| dc.subject.keywordAuthor | partition | - |
| dc.subject.keywordPlus | MINIMUM DEGREE | - |
| dc.subject.keywordPlus | GRAPH DECOMPOSITION | - |
- 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.