| Hamiltonian chains in hypergraphs GY Katona, HA Kierstead Journal of Graph Theory 30 (3), 205-212, 1999 | 200 | 1999 |
| SIS epidemic propagation on hypergraphs Á Bodó, GY Katona, PL Simon Bulletin of mathematical biology 78 (4), 713-735, 2016 | 117 | 2016 |
| Hypergraph extensions of the Erdős-Gallai theorem E Győri, GY Katona, N Lemons Electronic Notes in Discrete Mathematics 36, 655-662, 2010 | 94* | 2010 |
| Packing paths of length at least two M Kano, GY Katona, Z Király Discrete mathematics 283 (1-3), 129-135, 2004 | 78 | 2004 |
| Chordality and 2-factors in tough graphs D Bauer, GY Katona, D Kratsch, HJ Veldman Discrete applied mathematics 99 (1-3), 323-329, 2000 | 28 | 2000 |
| Toughness and edge-toughness GY Katona Discrete Mathematics 164 (1-3), 187-196, 1997 | 26 | 1997 |
| Breaking the hierarchy-a new cluster selection mechanism for hierarchical clustering methods. LA Zahoránszky, GY Katona, P Hári, A Málnási-Csizmadia, KA Zweig, ... Algorithms for Molecular Biology 4 (12), 1-22, 2009 | 23 | 2009 |
| Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs GY Katona, N Sieben Electronic Notes in Discrete Mathematics 38, 487-492, 2011 | 22 | 2011 |
| Extremal k-edge-hamiltonian hypergraphs P Frankl, GY Katona Discrete Mathematics 308 (8), 1415-1424, 2008 | 21 | 2008 |
| Odd subgraphs and matchings M Kano, GYGY Katona Discrete mathematics 250 (1-3), 265-272, 2002 | 17 | 2002 |
| The optimal rubbling number of ladders, prisms and Möbius-ladders GY Katona, LF Papp Discrete Applied Mathematics 209, 227-246, 2016 | 15 | 2016 |
| Properties of minimally t-tough graphs GY Katona, D Soltész, K Varga Discrete Mathematics, 2017 | 14 | 2017 |
| Most probably intersecting families of subsets GOH Katona, GY Katona, Z Katona Combinatorics, Probability and Computing 21 (1-2), 219-227, 2012 | 14 | 2012 |
| Hamiltonian path saturated graphs with small size A Dudek, GY Katona, A Paweł Wojda Discrete applied mathematics 154 (9), 1372-1379, 2006 | 14 | 2006 |
| Minimal toughness in special graph classes GY Katona, K Varga Discrete Mathematics & Theoretical Computer Science 25 (Special issues), 2023 | 12 | 2023 |
| Structure theorem and algorithm on (1, f)-odd subgraph M Kano, GY Katona Discrete Mathematics 307 (11-12), 1404-1417, 2007 | 12 | 2007 |
| Centrosymmetric graphs and a lower bound for graph energy of fullerenes GY Katona, M Faghani, AR Ashrafi Discussiones Mathematicae Graph Theory 34 (4), 751-768, 2014 | 11 | 2014 |
| Bounds on the number of edges in hypertrees GY Katona, PGN Szabó Discrete Mathematics 339 (7), 1884-1891, 2016 | 10 | 2016 |
| Properties of edge-tough graphs GY Katona Graphs and Combinatorics 15 (3), 315-325, 1999 | 10 | 1999 |
| The complexity of recognizing minimally tough graphs GY Katona, I Kovács, K Varga Discrete Applied Mathematics 294, 55-84, 2021 | 9 | 2021 |
László PappBudapesti Műszaki és Gazdaságtudományi EgyetemVerified email at cs.bme.hu