1. Decomposition of bounded degree graphs into C4-free subgraphs. (February 2015) Authors: Kang, Ross J.; Perarnau, Guillem Journal: European journal of combinatorics Issue: Volume 44:Part A(2015) Page Start: 99 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Fast recoloring of sparse graphs. (February 2016) Authors: Bousquet, Nicolas; Perarnau, Guillem Journal: European journal of combinatorics Issue: Volume 52: Part A (2016:Feb.) Page Start: 1 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Frozen (Δ + 1)-colourings of bounded degree graphs. (19th May 2021) Authors: Bonamy, Marthe; Bousquet, Nicolas; Perarnau, Guillem Journal: Combinatorics, probability and computing Issue: Volume 30:Number 3(2021) Page Start: 330 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. Rainbow matchings in Dirac bipartite graphs. Issue 2 (15th January 2019) Authors: Coulson, Matthew; Perarnau, Guillem Journal: Random structures & algorithms Issue: Volume 55:Issue 2(2019) Page Start: 271 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. The Glauber dynamics for edge‐colorings of trees. Issue 4 (26th September 2020) Authors: Delcourt, Michelle; Heinrich, Marc; Perarnau, Guillem Journal: Random structures & algorithms Issue: Volume 57:Issue 4(2020) Page Start: 1050 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗