Bounds on the maximum number of minimum dominating sets. - Samuel Connolly; Zachary Gabor; Anant P. Godbole; Bill Kay; Thomas Kelly 001 (Discret. Math., 2016)

Minimum size of feedback vertex sets of planar graphs of girth at least five. - Tom Kelly 001; Chun-Hung Liu (Eur. J. Comb., 2017)

Induced 2-Degenerate Subgraphs of Triangle-Free Planar Graphs. - Zdenek Dvorák 001; Tom Kelly 001 (Electron. J. Comb., 2018)

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

Size of the largest induced forest in subcubic graphs of girth at least four and five. - Tom Kelly 001; Chun-Hung Liu (J. Graph Theory, 2018)

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

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

A proof of the Erdös-Faber-Lovász conjecture: Algorithmic aspects. - Dong Yeap Kang; Tom Kelly 001; Daniela Kühn; Abhishek Methuku; Deryk Osthus (FOCS, 2021)

Graph and hypergraph colouring via nibble methods: A survey. - Dong Yeap Kang; Tom Kelly 001; Daniela Kühn; Abhishek Methuku; Deryk Osthus (CoRR, 2021)

A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree. - Tom Kelly 001; Daniela Kühn; Deryk Osthus (CoRR, 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)

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

Almost all optimally coloured complete graphs contain a rainbow Hamilton path. - Stephen Gould; Tom Kelly 001; Daniela Kühn; Deryk Osthus (J. Comb. Theory B, 2022)

Colorings, transversals, and local sparsity. - Ross J. Kang; Tom Kelly 001 (Random Struct. Algorithms, 2022)

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

Hamilton transversals in random Latin squares. - Stephen Gould; Tom Kelly 001 (Random Struct. Algorithms, 2023)

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

Optimal spread for spanning subgraphs of Dirac hypergraphs. - Tom Kelly 001; Alp Müyesser; Alexey Pokrovskiy (J. Comb. Theory B, 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)

A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. - Tom Kelly 001; Daniela Kühn; Deryk Osthus (Comb. Probab. Comput., 2024)

Perfect Matchings in Random Sparsifications of Dirac Hypergraphs. - Dong Yeap Kang; Tom Kelly 001; Daniela Kühn; Deryk Osthus; Vincent Pfenninger (Comb., 2024)