| On r-dynamic coloring of graphs S Jahanbekam, J Kim, S O, D West Discrete Applied Mathematics 206, 65-72, 2016 | 74 | 2016 |
| 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 | 48 | 2019 |
| A blow-up lemma for approximate decompositions J Kim, D Kühn, D Osthus, M Tyomkyn arxiv, 2016 | 44 | 2016 |
| 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 |
| 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 | 32 | 2014 |
| 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 | 19 | 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 |
| 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 |
| 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 | 17 | 2018 |
| The difference and ratio of the fractional matching number and the matching number of graphs I Choi, J Kim, S O Discrete Mathematics 339 (4), 1382-1386, 2016 | 16 | 2016 |
| 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 |
| Ramsey-minimal saturation numbers for matchings M Ferrara, J Kim, E Yeager Discrete Mathematics 322, 26-30, 2014 | 15 | 2014 |
| On the Erdős–Ko–Rado theorem and the Bollobás theorem for t-intersecting families DY Kang, J Kim, K Younjin European Journal of Combinatorics 47, 68-74, 2015 | 13 | 2015 |
| Average connectivity and average edge-connectivity in graphs J Kim, S O Discrete Mathematics 313 (20), 2232-2238, 2013 | 13 | 2013 |
| Harmonious coloring of trees with large maximum degree S Akbari, J Kim, AV Kostochka Discrete Mathematics 312 (10), 1633-1637, 2012 | 12 | 2012 |
| A characterization of testable hypergraph properties F Joos, J Kim, D Kühn, D Osthus 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017 | 11 | 2017 |
| Two Conjectures in Ramsey--Turán Theory J Kim, Y Kim, H Liu SIAM Journal on Discrete Mathematics 33 (1), 564-586, 2019 | 10 | 2019 |
| Forbidding induced even cycles in a graph: typical structure and counting J Kim, D Kühn, D Osthus, T Townsend Journal of Combinatorial Theory, Series B 131, 170-219, 2018 | 9 | 2018 |
| Bipartitions of highly connected tournaments J Kim, D Kühn, D Osthus SIAM J. Discrete Math. 30 (2), 895-911, 2016 | 9 | 2016 |
Daniela KuhnUniversity of BirminghamVerified email at bham.ac.uk
