Abstract
An equitable (t,k)-tree-coloring of a graph G is defined as a t-coloring of vertices of G such that each component of the subgraph induced by each col......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
