Abstract
Given two graphs H1 and H2, a graph is (H1, H2)-free if it contains no induced subgraph isomorphic to H1 or H2. Let Pt be the path on t vertices. A bu......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
