The Library
Packing six T-joins in plane graphs
Tools
Dvorak, Z., Kawarabayashi, K. and Králʼ, Daniel (2016) Packing six T-joins in plane graphs. Journal of Combinatorial Theory, Series B, 116 . pp. 287-305. doi:10.1016/j.jctb.2015.09.002 ISSN 0095-8956.
|
PDF
WRAP_1173667-ma-010915-tjoin6.pdf - Accepted Version - Requires a PDF viewer. Download (386Kb) | Preview |
Official URL: http://dx.doi.org/10.1016/j.jctb.2015.09.002
Abstract
Let G be a plane graph and T an even subset of its vertices. It
has been conjectured that if all T-cuts of G have the same parity and
the size of every T-cut is at least k, then G contains k edge-disjoint
T-joins. The case k = 3 is equivalent to the Four Color Theorem, and
the cases k = 4, which was conjectured by Seymour, and k = 5 were
proved by Guenin. We settle the next open case k = 6.
Item Type: | Journal Article | ||||||||
---|---|---|---|---|---|---|---|---|---|
Divisions: | Faculty of Science, Engineering and Medicine > Science > Mathematics | ||||||||
Journal or Publication Title: | Journal of Combinatorial Theory, Series B | ||||||||
Publisher: | Academic Press | ||||||||
ISSN: | 0095-8956 | ||||||||
Official Date: | January 2016 | ||||||||
Dates: |
|
||||||||
Volume: | 116 | ||||||||
Number of Pages: | 24 | ||||||||
Page Range: | pp. 287-305 | ||||||||
DOI: | 10.1016/j.jctb.2015.09.002 | ||||||||
Status: | Peer Reviewed | ||||||||
Publication Status: | Published | ||||||||
Access rights to Published version: | Restricted or Subscription Access | ||||||||
Date of first compliant deposit: | 12 February 2016 | ||||||||
Date of first compliant Open Access: | 12 September 2016 | ||||||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year