Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 Z Dvořák, L Postle Journal of Combinatorial Theory, Series B 129, 38-54, 2018 | 225 | 2018 |

Improved bounds for randomly sampling colorings via linear programming S Chen, M Delcourt, A Moitra, G Perarnau, L Postle Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 64 | 2019 |

Colouring graphs with sparse neighbourhoods: Bounds and applications M Bonamy, T Perrett, L Postle Journal of Combinatorial Theory, Series B 155, 278-317, 2022 | 59 | 2022 |

Breaking the degeneracy barrier for coloring graphs with no minor S Norin, L Postle, ZX Song arXiv preprint arXiv:1910.09378, 2019 | 39 | 2019 |

Reducing linear Hadwiger's conjecture to coloring small graphs M Delcourt, L Postle arXiv preprint arXiv:2108.01633, 2021 | 36 | 2021 |

Planar graphs of girth at least five are square (Δ+ 2)-choosable M Bonamy, DW Cranston, L Postle Journal of Combinatorial Theory, Series B 134, 218-238, 2019 | 28 | 2019 |

Five-coloring graphs on the Klein bottle N Chenette, L Postle, N Streib, R Thomas, C Yerger Journal of Combinatorial Theory, Series B 102 (5), 1067-1098, 2012 | 28 | 2012 |

Hyperbolic families and coloring graphs on surfaces L Postle, R Thomas Transactions of the American Mathematical Society, Series B 5 (7), 167-221, 2018 | 27 | 2018 |

Density of 5/2-critical graphs Z Dvořák, L Postle Combinatorica 37, 863-886, 2017 | 26 | 2017 |

An even better density increment theorem and its application to Hadwiger's conjecture L Postle arXiv preprint arXiv:2006.14945, 2020 | 25 | 2020 |

Progress towards Nash-Williams' conjecture on triangle decompositions M Delcourt, L Postle Journal of Combinatorial Theory, Series B 146, 382-416, 2021 | 23 | 2021 |

Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings M Delcourt, L Postle arXiv preprint arXiv:2204.08981, 2022 | 22 | 2022 |

5-list-coloring graphs on surfaces LJ Postle Georgia Institute of Technology, 2012 | 22 | 2012 |

Further progress towards Hadwiger’s conjecture L Postle arXiv preprint arXiv:2006.11798, 2020 | 21 | 2020 |

Bounding by a fraction of for graphs without large cliques M Bonamy, T Kelly, P Nelson, L Postle arXiv preprint arXiv:1803.01051, 2018 | 20* | 2018 |

A local epsilon version of Reed's Conjecture T Kelly, L Postle Journal of Combinatorial Theory, Series B 141, 181-222, 2020 | 19 | 2020 |

List coloring with requests Z Dvořák, S Norin, L Postle Journal of Graph Theory 92 (3), 191-206, 2019 | 18 | 2019 |

Connectivity and choosability of graphs with no Kt minor S Norin, L Postle Journal of Combinatorial Theory, Series B 158, 283-300, 2023 | 17 | 2023 |

Pebbling graphs of diameter three and four L Postle, N Streib, C Yerger Journal of Graph Theory 72 (4), 398-417, 2013 | 16 | 2013 |

5-list-coloring planar graphs with distant precolored vertices Z Dvořák, B Lidický, B Mohar, L Postle Journal of Combinatorial Theory, Series B 122, 311-352, 2017 | 15 | 2017 |