  A graph is $H$-free if it does not contain an induced subgraph isomorphic to
$H$. For every integer $k$ and every graph $H$, we determine the computational
complexity of $k$-Edge Colouring for $H$-free graphs.
