1. Filling the complexity gaps for colouring planar and bounded degree graphs. Issue 4 (31st May 2019) Authors: Dabrowski, Konrad K.; Dross, François; Johnson, Matthew; Paulusma, Daniël Journal: Journal of graph theory Issue: Volume 92:Issue 4(2019) Page Start: 377 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Partitioning a triangle-free planar graph into a forest and a forest of bounded degree. (December 2017) Authors: Dross, François; Montassier, Mickael; Pinlou, Alexandre Journal: European journal of combinatorics Issue: Volume 66(2017) Page Start: 81 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Powers of paths in tournaments. (23rd November 2021) Authors: Draganić, Nemanja; Dross, François; Fox, Jacob; Girão, António; Havet, Frédéric; Korándi, Dániel; Lochet, William; Correia, David Munhá; Scott, Alex; Sudakov, Benny Journal: Combinatorics, probability and computing Issue: Volume 30:Number 6(2021) Page Start: 894 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗