Classifying k-edge colouring for H-free graphs
Université de Fribourg
- Galby, Esther University of Fribourg
- Lima, Paloma T. University of Bergen
- Paulusma, Daniël Durham University
- Ries, Bernard University of Fribourg
-
2019
Published in:
- Information procesing letters. - 2019, vol. 146, p. 39-43
English
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.
- Faculty
- Faculté des sciences économiques et sociales et du management
- Department
- Département d'informatique
- Language
-
- English
- Classification
- Economics
- License
- License undefined
- Identifiers
-
- RERO DOC 324497
- DOI 10.1016/j.ipl.2019.02.006
- Persistent URL
- https://sonar.ch/global/documents/307537
Statistics
Document views: 45
File downloads:
- edge-coloring_rero.pdf: 164