5 citations · 13 across the 5 of their papers we have counts for
1 paper · 2 filters
Maria Chudnovsky, Alex Scott, Paul Seymour
For a graph G and a set of graphs H, we say that G is {\em H-free} if no induced subgraph of G is isomorphic to a member of H. Given an in…