1 paper
Ruiling Zheng, Gang Zhang
A graph is sad to be H-free if it does not contain H as a subgraph. Let H(k,3) be the graph formed by taking a cycle of length k and a triangle on a common vertex. Li, Lu a…