1 paper
Angele M. Foley, Dallas J. Fraser, Chinh T. Hoang +2
A hole is an induced cycle with at least four vertices. A hole is even if its number of vertices is even. Given a set L of graphs, a graph G is L-free if G does not contain any gra…