Katherine Edwards

A Relative of Hadwiger's Conjecture

Hadwigers conjecture asserts that if a simple graph

Edge-colouring eight-regular planar graphs

G

A Note on Hitting Maximum and Maximal Cliques With a Stable Set

has no

Edge-colouring seven-regular planar graphs

K_{t+1}

Three-edge-colouring doublecross cubic graphs

minor, then its vertex set

Partial Interval Set Cover – Trade-Offs between Scalability and Optimality

V(G)

Fast Approximation Algorithms for p-centers in Large \delta -hyperbolic Graphs

can be partitioned into

Bounding the Fractional Chromatic Number of

t

K_\Delta

stable sets. This is still open, but we prove under the same hypothesis that

-Free Graphs

V(G)