Abstract
For an edge-coloured graph G, the minimum colour degree of G means the minimum number of colours on edges which are incident to each vertex of G. We p......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
