Abstract
Total coloring is a variant of edge coloring where both vertices and edges are to be colored. A graph is totally k $k$-choosable if for any list assig......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
