We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham Research Online
You are in:

Classifying k-edge colouring for H-free graphs.

Galby, E. and Lima, P.T. and Paulusma, D. and Ries, B. (2019) 'Classifying k-edge colouring for H-free graphs.', Information processing letters., 146 . pp. 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.

Item Type:Article
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution Non-commercial No Derivatives.
Download PDF
Publisher Web site:
Publisher statement:© 2019 This manuscript version is made available under the CC-BY-NC-ND 4.0 license
Date accepted:18 February 2019
Date deposited:22 February 2019
Date of first online publication:20 February 2019
Date first made open access:20 February 2020

Save or Share this output

Look up in GoogleScholar