33 citations · 43 across the 8 of their papers we have counts for
1 paper · 2 filters
Jérémie Chalopin, Louis Esperet, Zhentao Li +1
Scott proved in 1997 that for any tree T, every graph with bounded clique number which does not contain any subdivision of T as an induced subgraph has bounded chromatic number…