adv

Classifying k-Edge Colouring for H-free Graphs. (arXiv:1810.04379v1 [cs.DS])

来源于:arXiv
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. 查看全文>>

发表评论