| Bounds on the maximum number of minimum dominating sets S Connolly, Z Gabor, A Godbole, B Kay, T Kelly Discrete Mathematics 339 (5), 1537-1542, 2016 | 18 | 2016 |
| Minimum size of feedback vertex sets of planar graphs of girth at least five T Kelly, CH Liu European Journal of Combinatorics 61, 138-150, 2017 | 16 | 2017 |
| A local epsilon version of Reed's Conjecture T Kelly, L Postle Journal of Combinatorial Theory, Series B 141, 181-222, 2020 | 14 | 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 | 14 | 2018 |
| Colorings, transversals, and local sparsity RJ Kang, T Kelly Random Structures & Algorithms 61 (1), 173-192, 2022 | 11 | 2022 |
| Graph and hypergraph colouring via nibble methods: A survey DY Kang, T Kelly, D Kühn, A Methuku, D Osthus arXiv preprint arXiv:2106.13733, 2021 | 8 | 2021 |
| Size of the largest induced forest in subcubic graphs of girth at least four and five T Kelly, CH Liu Journal of Graph Theory 89 (4), 457-478, 2018 | 8 | 2018 |
| The structure of binary matroids with no induced claw or Fano plane restriction M Bonamy, F Kardos, T Kelly, P Nelson, L Postle Advances in Combinatorics 1, 17pp., 2019 | 7 | 2019 |
| Almost all optimally coloured complete graphs contain a rainbow Hamilton path S Gould, T Kelly, D Kühn, D Osthus Journal of Combinatorial Theory, Series B 156, 57-100, 2022 | 6 | 2022 |
| Hamilton transversals in random Latin squares S Gould, T Kelly Random Structures & Algorithms 62 (2), 450-478, 2023 | 5 | 2023 |
| Exponentially many 4‐list‐colorings of triangle‐free graphs on surfaces T Kelly, L Postle Journal of Graph Theory 87 (2), 230-238, 2018 | 5 | 2018 |
| Thresholds for Latin squares and Steiner triple systems: Bounds within a logarithmic factor DY Kang, T Kelly, D Kühn, A Methuku, D Osthus arXiv preprint arXiv:2206.14472, 2022 | 3 | 2022 |
| Fractional coloring with local demands T Kelly, L Postle arXiv preprint arXiv:1811.11806, 2018 | 3 | 2018 |
| On the density of critical graphs with no large cliques T Kelly, L Postle Combinatorica, 1-33, 2023 | 2 | 2023 |
| A special case of Vu's conjecture: Coloring nearly disjoint graphs of bounded maximum degree T Kelly, D Kühn, D Osthus arXiv preprint arXiv:2109.11438, 2021 | 2 | 2021 |
| A proof of the Erd\H {o} s-Faber-Lov\'asz conjecture DY Kang, T Kelly, D Kühn, A Methuku, D Osthus arXiv preprint arXiv:2101.04698, 2021 | 2 | 2021 |
| Induced 2-degenerate Subgraphs of Triangle-free Planar Graphs Z Dvořák, T Kelly Electronic Journal of Combinatorics, 2017 | 2 | 2017 |
| Fractional vertex-arboricity of planar graphs M Bonamy, F Kardoš, T Kelly, L Postle arXiv preprint arXiv:2009.12189, 2020 | 1 | 2020 |
| Perfect matchings in random sparsifications of Dirac hypergraphs DY Kang, T Kelly, D Kühn, D Osthus, V Pfenninger arXiv preprint arXiv:2211.01325, 2022 | | 2022 |
| Solution to a problem of Erd\H {o} s on the chromatic index of hypergraphs with bounded codegree DY Kang, T Kelly, D Kühn, A Methuku, D Osthus arXiv preprint arXiv:2110.06181, 2021 | | 2021 |
Daniela KuhnUniversity of BirminghamVerified email at bham.ac.uk
