Abstract
For a graph G and a set F of connected graphs, G is said be F-free if G does not contain any member of F as an induced subgraph. We let G(3)(F) denote......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
