Abstract
Let G be a nontrivial connected and vertex-colored graph. A subset X of the vertex set of G is called rainbow if any two vertices in X have distinct c......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
