Affiner les résultats

Classifying k-edge colouring for H-free graphs

Galby, Esther ; T. Lima, Paloma ; Paulusma, Daniël ; Ries, Bernard

In: Information procesing letters, 2019, vol. 146, p. 39-43

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.