Classifying k-Edge Colouring for H-free Graphs

10/10/2018
by   Esther Galby, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset