A complexity dichotomy for signed H-colouring.
Discrete Mathematics(2018)
摘要
Verifying a conjecture of Brewster, Foucaud, Hell and Naserasr, we show that signed (H,Π)-colouring is NP-complete for any signed graph (H,Π) whose s-core has at least 3 edges.
更多查看译文
关键词
Signed graph,Edge coloured graph,Homomorphism complexity,Switching
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络