Abstract
The complexity of COLOURING is fully understood for H-free graphs, but there are still major complexity gaps if two induced subgraphs H-1 and H-2 are ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
