1. M. Bonamy, P. Charbit and S. Thomassé: Graphs with large chromatic number induce 3k-cycles, submitted for publication, arXiv:1408.2172.
2. M. Chudnovsky, A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures, J. Combinatorial Theory, Ser. B118 (2016), 109–128.
3. M. Chudnovsky, A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. III. Long holes, Combinatorica37 (2017), 1057–72.
4. M. Chudnovsky, A. Scott and P. Seymour: Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings, submitted for publication, arXiv:1609.00314.
5. M. Chudnovsky, A. Scott, P. Seymour and S. Spirkl: Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes, submitted for publication, arXiv:1701.07217.