Publication details
Packing six T-joins in plane graphs
| Authors | |
|---|---|
| Year of publication | 2016 |
| Type | Article in Periodical |
| Magazine / Source | JOURNAL OF COMBINATORIAL THEORY SERIES B |
| Citation | |
| Doi | http://dx.doi.org/10.1016/j.jctb.2015.09.002 |
| Keywords | Planar graphs; T-joins; Edge-coloring |
| Description | 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. (C) 2015 Elsevier Inc. All rights reserved. |