Abstract
Let G = (V, E) be a simple graph with n vertices and m edges, P(G, k) be the chromatic polynomial of G , and P(G, L) be the number of L-colorings of G......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
