Abstract
A graph G is edge-L-colorable if for a given edge assignment L = {L(e) : e is an element of E(G)}, there exists a proper edge-coloring phi of G such t......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
