Abstract
An (r - 1, 1)-coloring of an r-regular graph G is an edge coloring (with arbitrarily many colors) such that each vertex is incident to r - 1 edges of ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
