Abstract
A clique-coloring of a given graph G is a coloring of the vertices of G such that no maximal clique of size at least two is monocolored. The clique-ch......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
