1. Asymptotically good edge correspondence colourings. Issue 3 (24th January 2022) Authors: Molloy, Michael; Postle, Luke Journal: Journal of graph theory Issue: Volume 100:Issue 3(2022) Page Start: 559 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
2. Bounded diameter arboricity. Issue 4 (4th November 2018) Authors: Merker, Martin; Postle, Luke Journal: Journal of graph theory Issue: Volume 90:Issue 4(2019) Page Start: 629 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
3. Bounding the number of cycles in a graph in terms of its degree sequence. (January 2021) Authors: Dvořák, Zdeněk; Morrison, Natasha; Noel, Jonathan A.; Norin, Sergey; Postle, Luke 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) ↗
4. Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces. Issue 2 (21st May 2017) Authors: Kelly, Tom; Postle, Luke Journal: Journal of graph theory Issue: Volume 87:Issue 2(2018) Page Start: 230 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
5. List coloring with requests. Issue 3 (16th January 2019) Authors: Dvořák, Zdeněk; Norin, Sergey; Postle, Luke Journal: Journal of graph theory Issue: Volume 92:Issue 3(2019) Page Start: 191 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
6. On the clique number of the square of a line graph and its relation to maximum degree of the line graph. Issue 3 (30th January 2019) Authors: Faron, Maxime; Postle, Luke Journal: Journal of graph theory Issue: Volume 92:Issue 3(2019) Page Start: 261 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
7. On the Minimum Edge‐Density of 4‐Critical Graphs of Girth Five. Issue 4 (8th May 2017) Authors: Liu, Chun‐Hung; Postle, Luke Journal: Journal of graph theory Issue: Volume 86:Issue 4(2017) Page Start: 387 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
8. On the minimum number of edges in triangle-free 5-critical graphs. (December 2017) Authors: Postle, Luke Journal: European journal of combinatorics Issue: Volume 66(2017) Page Start: 264 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
9. Pebbling Graphs of Diameter Three and Four. Issue 4 (19th March 2012) Authors: Postle, Luke; Streib, Noah; Yerger, Carl Journal: Journal of graph theory Issue: Volume 72:Issue 4(2013) Page Start: 398 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗
10. Pebbling Graphs of Fixed Diameter. Issue 4 (21st February 2013) Authors: Postle, Luke Journal: Journal of graph theory Issue: Volume 75:Issue 4(2014) Page Start: 302 Record Type: Journal Article View Content: Available online (eLD content is only available in our Reading Rooms) ↗