Abstract
A graph G is said to be K-1,K-r-free if G does not contain an induced subgraph isomorphic to K-1,K-r. Let k, r, t be integers with k >= 2 and t >......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
