| 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 | 263 | 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 | 71 | 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 | 65 | 2022 |
| Reducing linear Hadwiger’s conjecture to coloring small graphs M Delcourt, L Postle Journal of the American Mathematical Society 38 (2), 481-507, 2025 | 44 | 2025 |
| Breaking the degeneracy barrier for coloring graphs with no minor S Norin, L Postle, ZX Song arXiv preprint arXiv:1910.09378, 2019 | 39 | 2019 |
| Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings M Delcourt, L Postle arXiv preprint arXiv:2204.08981, 2022 | 35 | 2022 |
| Hyperbolic families and coloring graphs on surfaces L Postle, R Thomas Transactions of the American Mathematical Society, Series B 5 (7), 167-221, 2018 | 34 | 2018 |
| 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 | 32 | 2012 |
| 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 | 30 | 2019 |
| Bounding by a fraction of for graphs without large cliques M Bonamy, T Kelly, P Nelson, L Postle arXiv preprint arXiv:1803.01051, 2018 | 28* | 2018 |
| Density of 5/2-critical graphs Z Dvořák, L Postle Combinatorica 37, 863-886, 2017 | 28 | 2017 |
| Progress towards Nash-Williams' conjecture on triangle decompositions M Delcourt, L Postle Journal of Combinatorial Theory, Series B 146, 382-416, 2021 | 27 | 2021 |
| An even better density increment theorem and its application to Hadwiger's conjecture L Postle arXiv preprint arXiv:2006.14945, 2020 | 26 | 2020 |
| A local epsilon version of Reed's Conjecture T Kelly, L Postle Journal of Combinatorial Theory, Series B 141, 181-222, 2020 | 25 | 2020 |
| 5-list-coloring graphs on surfaces LJ Postle Georgia Institute of Technology, 2012 | 24 | 2012 |
| Further progress towards Hadwiger’s conjecture L Postle arXiv preprint arXiv:2006.11798, 2020 | 23 | 2020 |
| List coloring with requests Z Dvořák, S Norin, L Postle Journal of Graph Theory 92 (3), 191-206, 2019 | 23 | 2019 |
| An improved bound for the linear arboricity conjecture R Lang, L Postle Combinatorica 43 (3), 547-569, 2023 | 20 | 2023 |
| Connectivity and choosability of graphs with no Kt minor S Norin, L Postle Journal of Combinatorial Theory, Series B 158, 283-300, 2023 | 18 | 2023 |
| 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 | 18 | 2017 |
