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