Galby, Esther Lima, Paloma T. Paulusma, Daniël Ries, Bernard 2019 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. application/pdf https://folia.unifr.ch/global/documents/307537 https://folia.unifr.ch/documents/307537/files/edge-coloring_rero.pdf eng info:eu-repo/semantics/altIdentifier/doi/10.1016/j.ipl.2019.02.006 info:eu-repo/semantics/openAccess License undefined Information procesing letters. - 2019, vol. 146, p. 39-43 Edge-colouring H-free graph Complexity Computational complexity info:eu-repo/classification/udc/33 Classifying k-edge colouring for H-free graphs http://purl.org/coar/resource_type/c_6501