Abstract
Let Ft (n) denote the family of all connected graphs of ordern with clique number t. In this paper, we present a new upper bound for the chromatic pol......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
