1. Subgraphs of large connectivity and chromatic number in graphs of large chromatic number;Alon;J Graph Theory,1987
2. Les problèmes de coloration en théorie des graphes;Berge;Publ Inst Statist Univ Paris,1960
3. Polynomial algorithm to recognize a Meyniel graph;Burlet;Ann Discrete Math,1984
4. J. Chalopin L. Esperet Z. Li P. Ossona de Mendez Restricted frame graphs and a conjecture of Scott
5. M. Chudnovsky A. D. Scott P. Seymour Colouring graphs with no long holes