| On r-dynamic coloring of graphs S Jahanbekam, J Kim, S O, D West Discrete Applied Mathematics 206, 65-72, 2016 | 74 | 2016 |
| On a rainbow version of Dirac's theorem F Joos, J Kim Bulletin of the London Mathematical Society 52 (3), 498-504, 2020 | 53 | 2020 |
| Optimal packings of bounded degree trees F Joos, J Kim, D Kühn, D Osthus Journal of the European Mathematical Society 21 (12), 3573-3647, 2019 | 51 | 2019 |
| Resolution of the Oberwolfach problem S Glock, F Joos, J Kim, D Kühn, D Osthus Journal of the European Mathematical Society 23 (8), 2511-2547, 2021 | 45 | 2021 |
| A blow-up lemma for approximate decompositions J Kim, D Kühn, D Osthus, M Tyomkyn arxiv, 2016 | 45 | 2016 |
| Spanning trees in randomly perturbed graphs F Joos, J Kim Random Structures & Algorithms 56 (1), 169-219, 2020 | 40 | 2020 |
| A relative of Hadwiger’s conjecture K Edwards, DY Kang, J Kim, S Oum, P Seymour SIAM J. Discrete Math. 29 (4), 2385-2388, 2015 | 40 | 2015 |
| Conflict‐free hypergraph matchings S Glock, F Joos, J Kim, M Kühn, L Lichev Journal of the London Mathematical Society 109 (5), e12899, 2024 | 34 | 2024 |
| Improper coloring of sparse graphs with a given girth, I: (0,1)-colorings of triangle-free graphs J Kim, AV Kostochka, X Zhu European J. of Combin. 42, 26-48, 2014 | 33 | 2014 |
| Extremal density for sparse minors and subdivisions J Haslegrave, J Kim, H Liu International Mathematics Research Notices 2022 (20), 15505-15548, 2022 | 30 | 2022 |
| Rainbow structures in locally bounded colorings of graphs J Kim, D Kühn, A Kupavskii, D Osthus Random Structures & Algorithms 56 (4), 1171-1204, 2020 | 28 | 2020 |
| Proof of Komlós's conjecture on Hamiltonian subsets J Kim, H Liu, M Sharifzadeh, K Staden Proceedings of the London Mathematical Society 115 (5), 974-1013, 2017 | 21 | 2017 |
| A bandwidth theorem for approximate decompositions P Condon, J Kim, D Kühn, D Osthus Proceedings of the London Mathematical Society 118 (6), 1393-1449, 2019 | 20 | 2019 |
| Nested cycles with no geometric crossings I Fernández, J Kim, Y Kim, H Liu Proceedings of the American Mathematical Society, Series B 9 (3), 22-32, 2022 | 18 | 2022 |
| Strong edge-colorings of sparse graphs with large maximum degree I Choi, J Kim, AV Kostochka, A Raspaud European Journal of Combinatorics 67, 21-39, 2018 | 18 | 2018 |
| Improper coloring of sparse graphs with a given girth, II: constructions J Kim, AV Kostochka, X Zhu J. Graph Theory 81 (4), 403-413, 2016 | 18 | 2016 |
| A bandwidth theorem for graph transversals D Chakraborti, S Im, J Kim, H Liu arXiv preprint arXiv:2302.09637, 2023 | 16 | 2023 |
| new results in t-tone coloing of graphs D Cranston, J Kim, WB Kinnersley The Electronic Journal of Combinatorics 20 (2), P17, 2013 | 16 | 2013 |
| Rainbow cycles in properly edge-colored graphs J Kim, J Lee, H Liu, T Tran Combinatorica 44 (4), 909-919, 2024 | 15 | 2024 |
| On the (6, 4)-problem of Brown, Erdős, and Sós S Glock, F Joos, J Kim, M Kühn, L Lichev, O Pikhurko Proceedings of the American Mathematical Society, Series B 11 (17), 173-186, 2024 | 15 | 2024 |
Daniela KuhnUniversity of BirminghamEmail verificata su bham.ac.uk
