Abstract
Let G be a nontrivial connected, edge-colored graph. An edge-cut R of G is called a rainbow cut if no two edges in R are colored the same. An edge-col......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
