Abstract
We give an efficient algorithm that, given a graph G and a partition V-1,..., V-m of its vertex set, finds either an independent transversal (an indep......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
