Abstract
The COLOURING problem is that of deciding, given a graph G and an integer k, whether G admits a (proper) k-colouring. For all graphs H up to five vert......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
