Abstract
For an edge-colored graph G, we call an edge-cut M of G monochromatic if the edges of M are colored with the same color. The graph G is called monochr......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
