Six-Critical Graphs on the Klein Bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger; Ken-ichi Kawarabayashi; Daniel Král; Jan Kyncl; Bernard Lidický (Electron. Notes Discret. Math., 2008)

Sub-Exponentially Many 3-Colorings of Triangle-Free Planar Graphs. - Arash Asadi; Luke Postle; Robin Thomas 001 (Electron. Notes Discret. Math., 2009)

Decomposing infinite matroids into their 3-connected minors. - Elad Aigner-Horev; Reinhard Diestel; Luke Postle (Electron. Notes Discret. Math., 2011)

Minor-minimal non-projective planar graphs with an internal 3-separation. - Arash Asadi; Luke Postle; Robin Thomas 001 (Electron. Notes Discret. Math., 2011)

Five-coloring graphs on the Klein bottle. - Nathan Chenette; Luke Postle; Noah Streib; Robin Thomas 001; Carl Yerger (J. Comb. Theory B, 2012)

5-list-coloring graphs on surfaces. - Luke Postle (2012)

Sub-exponentially many 3-colorings of triangle-free planar graphs. - Arash Asadi; Zdenek Dvorák 001; Luke Postle; Robin Thomas 001 (J. Comb. Theory B, 2013)

Pebbling Graphs of Diameter Three and Four. - Luke Postle; Noah Streib; Carl Yerger (J. Graph Theory, 2013)

Pebbling Graphs of Fixed Diameter. - Luke Postle (J. Graph Theory, 2014)

On the Minimum Edge-Density of 5-Critical Triangle-Free Graphs. - Luke Postle (Electron. Notes Discret. Math., 2015)

Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphs. - Luke Postle; Robin Thomas 001 (J. Comb. Theory B, 2015)

Hyperbolic families and coloring graphs on surfaces. - Luke Postle; Robin Thomas 001 (CoRR, 2016)

The structure of 2-separations of infinite matroids. - Elad Aigner-Horev; Reinhard Diestel; Luke Postle (J. Comb. Theory B, 2016)

Five-list-coloring graphs on surfaces II. A linear bound for critical graphs in a disk. - Luke Postle; Robin Thomas 001 (J. Comb. Theory B, 2016)

Density of 5/2-critical graphs. - Zdenek Dvorák 001; Luke Postle (Comb., 2017)

On the minimum number of edges in triangle-free 5-critical graphs. - Luke Postle (Eur. J. Comb., 2017)

On Star Decompositions of Random Regular Graphs. - Michelle Delcourt; Luke Postle (Electron. Notes Discret. Math., 2017)

On the List Coloring Version of Reed's Conjecture. - Michelle Delcourt; Luke Postle (Electron. Notes Discret. Math., 2017)

Modified linear programming and class 0 bounds for graph pebbling. - Daniel W. Cranston; Luke Postle; Chenxiao Xue; Carl Yerger (J. Comb. Optim., 2017)

5-list-coloring planar graphs with distant precolored vertices. - Zdenek Dvorák 001; Bernard Lidický; Bojan Mohar; Luke Postle (J. Comb. Theory B, 2017)

On the Minimum Edge-Density of 4-Critical Graphs of Girth Five. - Chun-Hung Liu; Luke Postle (J. Graph Theory, 2017)

Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold. - Michelle Delcourt; Guillem Perarnau; Luke Postle (CoRR, 2018)

Fractional coloring with local demands. - Tom Kelly 001; Luke Postle (CoRR, 2018)

Reconstruction of infinite matroids from their 3-connected minors. - Nathan J. Bowler; Johannes Carmesin; Luke Postle (Eur. J. Comb., 2018)

Random 4-regular graphs have 3-star decompositions asymptotically almost surely. - Michelle Delcourt; Luke Postle (Eur. J. Comb., 2018)

Chromatic index determined by fractional chromatic index. - Guantao Chen; Yuping Gao; Ringi Kim; Luke Postle; Songling Shan (J. Comb. Theory B, 2018)

Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8. - Zdenek Dvorák 001; Luke Postle (J. Comb. Theory B, 2018)

Characterizing 4-critical graphs with Ore-degree at most seven. - Luke Postle (J. Comb. Theory B, 2018)

Five-list-coloring graphs on surfaces III. One list of size one and one list of size two. - Luke Postle; Robin Thomas 001 (J. Comb. Theory B, 2018)

Exponentially many 4-list-colorings of triangle-free graphs on surfaces. - Tom Kelly 001; Luke Postle (J. Graph Theory, 2018)

Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces. - Luke Postle (FOCS, 2019)

Improved Bounds for Randomly Sampling Colorings via Linear Programming. - Sitan Chen; Michelle Delcourt; Ankur Moitra; Guillem Perarnau; Luke Postle (SODA, 2019)

Planar graphs of girth at least five are square (Δ + 2)-choosable. - Marthe Bonamy; Daniel W. Cranston; Luke Postle (J. Comb. Theory B, 2019)

List coloring with requests. - Zdenek Dvorák 001; Sergey Norin; Luke Postle (J. Graph Theory, 2019)

On the clique number of the square of a line graph and its relation to maximum degree of the line graph. - Maxime Faron; Luke Postle (J. Graph Theory, 2019)

Bounded diameter arboricity. - Martin Merker; Luke Postle (J. Graph Theory, 2019)

A local epsilon version of Reed's Conjecture. - Tom Kelly 001; Luke Postle (J. Comb. Theory B, 2020)

Reducing Linear Hadwiger's Conjecture to Coloring Small Graphs. - Michelle Delcourt; Luke Postle (CoRR, 2021)

Bounding the number of cycles in a graph in terms of its degree sequence. - Zdenek Dvorák 001; Natasha Morrison; Jonathan A. Noel; Sergey Norin; Luke Postle (Eur. J. Comb., 2021)

Progress towards Nash-Williams' conjecture on triangle decompositions. - Michelle Delcourt; Luke Postle (J. Comb. Theory B, 2021)

Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222]. - Tom Kelly 001; Luke Postle (J. Comb. Theory B, 2021)

3-List-coloring graphs of girth at least five on surfaces. - Luke Postle (J. Comb. Theory B, 2021)

The list linear arboricity of graphs. - Ringi Kim; Luke Postle (J. Graph Theory, 2021)

On the Density of C7-Critical Graphs. - Luke Postle; Evelyne Smith-Roberge (Comb., 2022)

The chromatic number of triangle-free hypergraphs. - Lina Li; Luke Postle (CoRR, 2022)

Bounding χ by a fraction of Δ for graphs without large cliques. - Marthe Bonamy; Tom Kelly 001; Peter Nelson; Luke Postle (J. Comb. Theory B, 2022)

Colouring graphs with sparse neighbourhoods: Bounds and applications. - Marthe Bonamy; Thomas Perrett; Luke Postle (J. Comb. Theory B, 2022)

Triangle-free planar graphs with at most 64n0.731 3-colorings. - Zdenek Dvorák 001; Luke Postle (J. Comb. Theory B, 2022)

Structure in sparse k-critical graphs. - Ronald J. Gould; Victor Larsen; Luke Postle (J. Comb. Theory B, 2022)

Asymptotically good edge correspondence colourings. - Michael Molloy 001; Luke Postle (J. Graph Theory, 2022)

On Decidability of Hyperbolicity. - Zdenek Dvorák 001; Luke Postle (Comb., 2022)

Local Hadwiger's Conjecture. - Benjamin R. Moore; Luke Postle; Lise Turner (J. Comb. Theory B, 2023)

Connectivity and choosability of graphs with no Kt minor. - Sergey Norin; Luke Postle (J. Comb. Theory B, 2023)

On the Density of Critical Graphs with No Large Cliques. - Tom Kelly 001; Luke Postle (Comb., 2023)

An Improved Bound for the Linear Arboricity Conjecture. - Richard Lang; Luke Postle (Comb., 2023)

Improving the Caro-Wei bound and applications to Turán stability. - Tom Kelly 001; Luke Postle (Discret. Appl. Math., 2024)

Fractional coloring with local demands and applications to degree-sequence bounds on the independence number. - Tom Kelly 001; Luke Postle (J. Comb. Theory B, 2024)

Edge-colouring graphs with local list sizes. - Marthe Bonamy; Michelle Delcourt; Richard Lang; Luke Postle (J. Comb. Theory B, 2024)

Decomposing random regular graphs into stars. - Michelle Delcourt; Catherine S. Greenhill; Mikhail Isaev; Bernard Lidický; Luke Postle (Eur. J. Comb., 2025)

Hyperbolicity theorems for correspondence colouring. - Luke Postle; Evelyne Smith-Roberge (J. Comb. Theory B, 2025)