1 paper
HaoRan Zhang, WenHuan Wang
Let F be a given family of graphs. A graph G is F-free if it does not contain any member of F as a subgraph. Let Cl,l be a graph obta…