Abstract
A vertex colouring f : V (G) -> C of a graph G is complete if for any two distinct colours c(1), c(2) is an element of C there is an edge {v(1), v(......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
