Abstract
Given a family F of graphs, a graph G is called F-free if G contains none of F as its subgraph. The following problem is one of the most concerned pro......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
