1. 2‐Distance Coloring of Sparse Graphs. Issue 3 (27th February 2014) Authors: Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre Journal: Journal of graph theory Issue: Volume 77:Issue 3(2014) Page Start: 190 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. A Complexity Dichotomy for the Coloring of Sparse Graphs. Issue 1 (26th June 2012) Authors: Esperet, Louis; Montassier, Mickaël; Ochem, Pascal; Pinlou, Alexandre Journal: Journal of graph theory Issue: Volume 73:Issue 1(2013) Page Start: 85 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Homomorphisms of 2‐Edge‐Colored Triangle‐Free Planar Graphs. Issue 1 (16th June 2016) Authors: Ochem, Pascal; Pinlou, Alexandre; Sen, Sagnik Journal: Journal of graph theory Issue: Volume 85:Issue 1(2017) Page Start: 258 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
4. 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) ↗
5. R-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9. (January 2021) Authors: La, Hoang; Montassier, Mickael; Pinlou, Alexandre; Valicov, Petru Journal: European journal of combinatorics Issue: Volume 91(2021) Page Start: Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗