Abstract
A graph G is called {H-1, H-2,..., H-k}-free if G contains no induced subgraph isomorphic to any graph H-i, 1 i k. We define sigma k=min{Sigma i=1kd(v......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
