Abstract
Let G be an edge-coloured graph. The minimum colour degree delta(c) (G) of G is the largest integer k such that, for every vertex v, there are at leas......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
