Journal article

Classifying k-edge colouring for H-free graphs

Show more…
    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
Department
Département d'informatique
Language
  • English
Classification
Economics
License
License undefined
Identifiers
Persistent URL
https://folia.unifr.ch/unifr/documents/307537
Statistics

Document views: 8 File downloads:
  • edge-coloring_rero.pdf: 13