- χ by a fraction of Δ for graphs without large cliquesjctb, 157:263-282, 2022. [doi]
- Colouring graphs with sparse neighbourhoods: Bounds and applicationsjctb, 155:278-317, 2022. [doi]
- Triangle-free planar graphs with at most 64n0.731 3-coloringsjctb, 156:294-298, 2022. [doi]
- k-critical graphsjctb, 156:194-222, 2022. [doi]
- Asymptotically good edge correspondence colouringsjgt, 100(3):559-577, 2022. [doi]
- 7-Critical Graphscombinatorica, 42(2):253-300, 2022. [doi]

- Progress towards Nash-Williams' conjecture on triangle decompositionsjctb, 146:382-416, 2021. [doi]
- Corrigendum to "A local epsilon version of Reed's Conjecture" [J. Combin. Theory Ser. B 141 (2020) 181-222]jctb, 151:509-512, 2021. [doi]
- The list linear arboricity of graphsjgt, 98(1):125-140, 2021. [doi]
- 3-List-coloring graphs of girth at least five on surfacesjctb, 147:1-36, 2021. [doi]

- A local epsilon version of Reed's ConjectureJCT, 141:181-222, 2020. [doi]

- Planar graphs of girth at least five are square (Δ + 2)-choosableJCT, 134:218-238, 2019. [doi]
- List coloring with requestsjgt, 92(3):191-206, 2019. [doi]
- On the clique number of the square of a line graph and its relation to maximum degree of the line graphjgt, 92(3):261-274, 2019. [doi]
- Bounded diameter arboricityjgt, 90(4):629-641, 2019. [doi]

- Reconstruction of infinite matroids from their 3-connected minorsejc, 67:126-144, 2018. [doi]
- Chromatic index determined by fractional chromatic indexJCT, 131:85-108, 2018. [doi]
- Random 4-regular graphs have 3-star decompositions asymptotically almost surelyejc, 72:97-111, 2018. [doi]
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8JCT, 129:38-54, 2018. [doi]
- Exponentially many 4-list-colorings of triangle-free graphs on surfacesjgt, 87(2):230-238, 2018. [doi]
- Characterizing 4-critical graphs with Ore-degree at most sevenJCT, 129:107-147, 2018. [doi]

- Modified linear programming and class 0 bounds for graph pebblingjco, 34(1):114-132, 2017. [doi]
- On Star Decompositions of Random Regular Graphsendm, 61:339-342, 2017. [doi]
- On the List Coloring Version of Reed's Conjectureendm, 61:343-349, 2017. [doi]
- Density of 5/2-critical graphscombinatorica, 37(5):863-886, 2017. [doi]
- 5-list-coloring planar graphs with distant precolored verticesJCT, 122:311-352, 2017. [doi]
- A Local Epsilon Version of Reed's Conjectureendm, 61:719-725, 2017. [doi]
- On the Minimum Edge-Density of 4-Critical Graphs of Girth Fivejgt, 86(4):387-405, 2017. [doi]
- On the minimum number of edges in triangle-free 5-critical graphsejc, 66:264-280, 2017. [doi]

- The structure of 2-separations of infinite matroidsJCT, 116:25-56, 2016. [doi]

- Five-list-coloring graphs on surfaces I. Two lists of size two in planar graphsJCT, 111:234-241, 2015. [doi]
- On the Minimum Edge-Density of 5-Critical Triangle-Free Graphsendm, 49:667-673, 2015. [doi]

- Pebbling Graphs of Fixed Diameterjgt, 75(4):302-310, 2014. [doi]

- Sub-exponentially many 3-colorings of triangle-free planar graphsJCT, 103(6):706-712, 2013. [doi]
- Pebbling Graphs of Diameter Three and Fourjgt, 72(4):398-417, 2013. [doi]

- Five-coloring graphs on the Klein bottleJCT, 102(5):1067-1098, 2012. [doi]

- Decomposing infinite matroids into their 3-connected minorsendm, 38:11-16, 2011. [doi]

- Pebbling Graphs of Diameter Three and Fourendm, 34:21-28, 2009. [doi]

- Six-Critical Graphs on the Klein Bottleendm, 31:235-240, 2008. [doi]