34 citations · 41 across the 8 of their papers we have counts for
5 papers · 1 filter
Half-integral linkages in highly connected directed graphs
Katherine Edwards, Irene Muzi, Paul Wollan
We study the half-integral -Directed Disjoint Paths Problem (kDDPP) in highly strongly connected digraphs. The integral kDDPP is NP-complete even when restricted to in…
On paths, stars and wyes in trees
Sébastien Bubeck, Katherine Edwards, Horia Mania +1
We further the study of local profiles of trees. Bubeck and Linial showed that the set of 5-profiles contains a certain polytope, namely the convex hull of d-millipedes, and they p…
Three-edge-colouring doublecross cubic graphs
Katherine Edwards, Daniel P. Sanders, Paul Seymour +1
A graph is apex if there is a vertex whose deletion makes the graph planar, and doublecross if it can be drawn in the plane with only two crossings, both incident with the infinite…
A relative of Hadwiger's conjecture
Katherine Edwards, Dong Yeap Kang, Jaehoon Kim +2
Hadwiger's conjecture asserts that if a simple graph has no minor, then its vertex set can be partitioned into stable sets. This is still open, but we prov…
Extension from Precoloured Sets of Edges
Katherine Edwards, António Girão, Jan van den Heuvel +3
We consider precolouring extension problems for proper edge-colourings of graphs and multigraphs, in an attempt to prove stronger versions of Vizing's and Shannon's bounds on the c…