Classifying k-Edge Colouring for H-free Graphs
Classifying k-Edge Colouring for H-free Graphs
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.
Paloma T. Lima、Esther Galby、Bernard Ries、Daniel Paulusma
数学
Paloma T. Lima,Esther Galby,Bernard Ries,Daniel Paulusma.Classifying k-Edge Colouring for H-free Graphs[EB/OL].(2018-10-10)[2025-07-21].https://arxiv.org/abs/1810.04379.点此复制
评论