Hamiltonian chains in hypergraphs GY Katona, HA Kierstead Journal of Graph Theory 30 (3), 205-212, 1999 | 190 | 1999 |
SIS epidemic propagation on hypergraphs Á Bodó, GY Katona, PL Simon Bulletin of mathematical biology 78 (4), 713-735, 2016 | 98 | 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 | 90* | 2010 |
Packing paths of length at least two M Kano, GY Katona, Z Király Discrete mathematics 283 (1-3), 129-135, 2004 | 71 | 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 | 29 | 2000 |
Toughness and edge-toughness GY Katona Discrete Mathematics 164 (1-3), 187-196, 1997 | 25 | 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 | 24 | 2009 |
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs GY Katona, N Sieben Electronic Notes in Discrete Mathematics 38, 487-492, 2011 | 21 | 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 | 18 | 2002 |
Properties of minimally t-tough graphs GY Katona, D Soltész, K Varga Discrete Mathematics, 2017 | 14 | 2017 |
The optimal rubbling number of ladders, prisms and Möbius-ladders GY Katona, LF Papp Discrete Applied Mathematics 209, 227-246, 2016 | 14 | 2016 |
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 |
Bounds on the number of edges in hypertrees GY Katona, PGN Szabó Discrete Mathematics 339 (7), 1884-1891, 2016 | 10 | 2016 |
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 | 10 | 2014 |
Properties of edge-tough graphs GY Katona Graphs and Combinatorics 15 (3), 315-325, 1999 | 10 | 1999 |
Extremal P_4-stable graphs I Horváth, GY Katona Discrete Applied Mathematics 159 (16), 1786-1792, 2011 | 9 | 2011 |
The complexity of recognizing minimally tough graphs GY Katona, I Kovács, K Varga Discrete Applied Mathematics 294, 55-84, 2021 | 8 | 2021 |
HAMILTONIAN CHAINS IN HYPERGRAPHS-A SURVEY GY Katona Graphs, combinatorics, algorithms and applications, 71, 2005 | 6 | 2005 |
Edge disjoint polyp packing GY Katona Discrete applied mathematics 78 (1-3), 133-152, 1997 | 6 | 1997 |
Constructions for the optimal pebbling of grids E Győri, GY Katona, LF Papp arXiv preprint arXiv:1601.02229, 2016 | 5 | 2016 |
Hamilton-chain saturated hypergraphs A Dudek, A Żak, GY Katona Discrete Mathematics 310 (6-7), 1172-1176, 2010 | 5 | 2010 |
Elementary graphs with respect to f-parity factors M Kano, GY Katona, J Szabó Graphs and Combinatorics 25 (5), 717-726, 2009 | 5 | 2009 |
Optimal pebbling number of the square grid E Győri, GY Katona, LF Papp Graphs and Combinatorics, 1-27, 2020 | 4 | 2020 |
The optimal pebbling number of staircase graphs E Győri, GY Katona, LF Papp, C Tompkins Discrete Mathematics, 2018 | 4 | 2018 |
BME VIK Annual Research Report on Electrical Engineering and Computer Science 2015 I Vajk, G Harsányi, A Poppe, S Imre, B Kiss, Á Jobbágy, G Katona, L Nagy, ... Periodica Polytechnica Electrical Engineering and Computer Science 60 (1), 1-36, 2016 | 4 | 2016 |
A Lower Bound for Graph Energy of Fullerenes M Faghani, GY Katona, AR Ashrafi, F Koorepazan-Moftakhar Distance, Symmetry, and Topology in Carbon Nanomaterials, 463-471, 2016 | 4 | 2016 |
Hamiltonian Chains in Hypergraphs GY Katona Electronic Notes in Discrete Mathematics 25, 81-87, 2006 | 4 | 2006 |
Optimal pebbling and rubbling of graphs with given diameter E Győri, GY Katona, LF Papp Discrete Applied Mathematics 266, 340-345, 2019 | 3 | 2019 |
Extremal stable graphs GY Katona, I Horváth 8 th Cologne-Twente Workshop on Graphs and Combinatorial Optimization CTW09, 149, 2009 | 3 | 2009 |
Extremal k-edge-hamiltonian Hypergraphs P Frankl, GY Katona Electronic Notes in Discrete Mathematics 5, 130-133, 2000 | 3 | 2000 |
Minimally tough chordal graphs with toughness at most 1/2 GY Katona, H Khan Discrete Mathematics, 113491, 2023 | 2 | 2023 |
Local topological toughness F Göring, GY Katona Eingereicht bei: Graphs and Combinatorics, 0 | 2 | |
Conditions for minimally tough graphs C Dallard, B Fernández, GY Katona, M Milanič, K Varga arXiv preprint arXiv:2210.00383, 2022 | 1 | 2022 |
Optimal pebbling number of graphs with given minimum degree A Czygrinow, G Hurlbert, GY Katona, LF Papp Discrete Applied Mathematics 260, 117-130, 2019 | 1 | 2019 |
Paths and cycles in hypergraphs GY Katona Graph Theory Conference in honor of Egawa’s 60th birthday, 2013 | 1 | 2013 |
Elementary graphs with respect to (1, f)-odd factors M Kano, GY Katona, J Szabo submitted, 2008 | 1 | 2008 |
Local topological toughness and local factors F Göring, GY Katona Graphs and Combinatorics 23 (4), 387-399, 2007 | 1 | 2007 |
m-Path Cover Saturated Graphs A Dudek, GY Katona, AP Wojda Electronic Notes in Discrete Mathematics 13, 41-44, 2003 | 1 | 2003 |
Vertex disjoint Polyp Packing GY Katona Annales Univ. Sci. Budapest, Sect. Comp. 21, 81-118, 2002 | 1 | 2002 |
Towards a Baranyai theorem with additional condition GOH Katona, GY Katona arXiv preprint arXiv:2312.09134, 2023 | | 2023 |
Strengthening some complexity results on toughness of graphs GY Katona, K Varga Discussiones Mathematicae Graph Theory 43 (2), 401-419, 2023 | | 2023 |
Optimal pebbling of grids E Győri, GY Katona, LF Papp | | 2015 |
Upper Bound on the Optimal Rubbling Number in graphs with given minimum degree GY Katona, LF Papp | | 2015 |
Optimal pebbling of grids GY Katona, E Győri, LF Papp | | 2015 |
Extension of paths and cycles for hypergraphs GY Katona Electronic Notes in Discrete Mathematics 45, 3-7, 2014 | | 2014 |
Elementary graphs with respect to f-parity factors K Mikio, GY Katona, J Szabó | | 2009 |
Extremal k-edge-hamiltonian Hypergraphs P Prankl, GY Katona Electronic Notes in Discrete Mathematics 10, 109-112, 2001 | | 2001 |
A large set of non-Hamiltonian graphs GY Katona Discrete applied mathematics 115 (1), 99-115, 2001 | | 2001 |
Paths and Cycles in Graphs and Hypergraphs GY Katona Hungarian Academy of Science, 1996 | | 1996 |
Searching for f-hamiltonian circuits GY Katona Combinatorica 12 (2), 241-245, 1992 | | 1992 |
Annales Univ. Sci. Budapest, Sect. Comp. 21 (2002) 81-118 GY Katona | | |