Classifying k-Edge Colouring for H-free Graphs
classification
💻 cs.DS
cs.CCcs.DMmath.CO
keywords
colouringeveryfreegraphgraphsclassifyingcomplexitycomputational
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.