Gyula Y. Katona

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 18

Top Topics

Graph Theoretic

Engineering And Computer Science

Top Venues

Discret. Appl. Math.

Publications

Levon Aslanyan, Gyula Y. Katona, Hasmik Sahakyan
Shadow Minimization Boolean Function Reconstruction. Informatica 35 (1) (2024)
Gyula Y. Katona, Kitti Varga
Strengthening some complexity results on toughness of graphs. Discuss. Math. Graph Theory 43 (2) (2023)
Gyula Y. Katona, Humara Khan
Minimally tough chordal graphs with toughness at most 1/2. CoRR (2022)
Clément Dallard, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga
Conditions for minimally tough graphs. CoRR (2022)
Gyula Y. Katona, István Kovács, Kitti Varga
The complexity of recognizing minimally tough graphs. Discret. Appl. Math. 294 (2021)
Ervin Györi, Gyula Y. Katona, László F. Papp
Optimal Pebbling Number of the Square Grid. Graphs Comb. 36 (3) (2020)
Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins
The optimal pebbling number of staircase graphs. Discret. Math. 342 (7) (2019)
Ervin Györi, Gyula Y. Katona, László F. Papp
Optimal pebbling and rubbling of graphs with given diameter. Discret. Appl. Math. 266 (2019)
Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp
Optimal pebbling number of graphs with given minimum degree. Discret. Appl. Math. 260 (2019)
Gyula Y. Katona, Kitti Varga
Strengthening some complexity results on toughness of graphs. CoRR (2019)
Gyula Y. Katona, Daniel Soltész, Kitti Varga
Properties of minimally t-tough graphs. Discret. Math. 341 (1) (2018)
Mikio Kano, Gyula Y. Katona, Kitti Varga
Decomposition of a Graph into Two Disjoint Odd Subgraphs. Graphs Comb. 34 (6) (2018)
Hassan Charaf, Gábor Harsányi, András Poppe, Sándor Imre, Bálint Kiss, Tamás Dabóczi, Gyula Y. Katona, Lajos Nagy, Gábor Magyar, István Kiss
BME VIK Annual Research Report on Electrical Engineering and Computer Science 2016. Period. Polytech. Electr. Eng. Comput. Sci. 61 (2) (2017)
Gyula Y. Katona, István Kovács, Kitti Varga
The complexity of recognizing minimally tough graphs. CoRR (2017)
Ervin Györi, Gyula Y. Katona, László F. Papp
Constructions for the Optimal Pebbling of Grids. Period. Polytech. Electr. Eng. Comput. Sci. 61 (2) (2017)
Ervin Györi, Gyula Y. Katona, Nathan Lemons
Hypergraph extensions of the Erdős-Gallai Theorem. Eur. J. Comb. 58 (2016)
Gyula Y. Katona, Péter G. N. Szabó
Bounds on the number of edges in hypertrees. Discret. Math. 339 (7) (2016)
Gyula Y. Katona, László F. Papp
The optimal rubbling number of ladders, prisms and Möbius-ladders. Discret. Appl. Math. 209 (2016)
Ervin Györi, Gyula Y. Katona, László F. Papp
Optimal pebbling of grids. CTW (2015)
Ali Reza Ashrafi, Morteza Faghani, Gyula Y. Katona
Centrosymmetric graphs and a lower bound for graph energy of fullerenes. Discuss. Math. Graph Theory 34 (4) (2014)
Gyula Y. Katona
Extension of paths and cycles for hypergraphs. Electron. Notes Discret. Math. 45 (2014)
Gyula Y. Katona, Nándor Sieben
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs. Graphs Comb. 29 (3) (2013)
Gyula O. H. Katona, Gyula Y. Katona, Zsolt Katona
Most Probably Intersecting Families of Subsets. Comb. Probab. Comput. 21 (1-2) (2012)
Illés Horváth, Gyula Y. Katona
-stable graphs. Discret. Appl. Math. 159 (16) (2011)
Gyula Y. Katona, Nándor Sieben
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs. Electron. Notes Discret. Math. 38 (2011)
Ervin Györi, Gyula Y. Katona, Nathan Lemons
Hypergraph Extensions of the Erdos-Gallai Theorem. Electron. Notes Discret. Math. 36 (2010)
Aneta Dudek, Andrzej Zak, Gyula Y. Katona
Hamilton-chain saturated hypergraphs. Discret. Math. 310 (6-7) (2010)
Gyula Y. Katona, Illés Horváth
Extremal Stable Graphs. CTW (2009)
Mikio Kano, Gyula Y. Katona, Jácint Szabó
-Parity Factors. Graphs Comb. 25 (5) (2009)
László A. Zahoránszky, Gyula Y. Katona, Péter Hári, András Málnási-Csizmadia, Katharina Anna Zweig, Gergely Zahoránszky-Köhalmi
Breaking the hierarchy - a new cluster selection mechanism for hierarchical clustering methods. Algorithms Mol. Biol. 4 (2009)
Peter Frankl, Gyula Y. Katona
Extremal k-edge-hamiltonian hypergraphs. Discret. Math. 308 (8) (2008)
Frank Göring, Gyula Y. Katona
Local Topological Toughness and Local Factors. Graphs Comb. 23 (4) (2007)
Mikio Kano, Gyula Y. Katona
Structure theorem and algorithm on (1, f)-odd subgraph. Discret. Math. 307 (11-12) (2007)
Gyula Y. Katona
Hamiltonian Chains in Hypergraphs. Electron. Notes Discret. Math. 25 (2006)
Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda
Hamiltonian path saturated graphs with small size. Discret. Appl. Math. 154 (9) (2006)
Mikio Kano, Gyula Y. Katona, Zoltán Király
Packing paths of length at least two. Discret. Math. 283 (1-3) (2004)
Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda
m_Path Cover Saturated Graphs. Electron. Notes Discret. Math. 13 (2003)
Mikio Kano, Gyula Y. Katona
Odd subgraphs and matchings. Discret. Math. 250 (1-3) (2002)
Gyula Y. Katona
A large set of non-Hamiltonian graphs. Discret. Appl. Math. 115 (1-3) (2001)
Peter Frankl, Gyula Y. Katona
Extremal k-edge-hamiltonian Hypergraphs. Electron. Notes Discret. Math. 10 (2001)
Peter Frankl, Gyula Y. Katona
Extremal k-edge-hamiltonian Hypergraphs. Electron. Notes Discret. Math. 5 (2000)
Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
Chordality and 2-factors in Tough Graphs. Discret. Appl. Math. 99 (1-3) (2000)
Gyula Y. Katona, Hal A. Kierstead
Hamiltonian chains in hypergraphs. J. Graph Theory 30 (3) (1999)
Gyula Y. Katona
Properties of Edge-Tough Graphs. Graphs Comb. 15 (3) (1999)
Gyula Y. Katona
Edge Disjoint Polyp Packing. Discret. Appl. Math. 78 (1-3) (1997)
Gyula Y. Katona
Toughness and edge-toughness. Discret. Math. 164 (1-3) (1997)
Gyula Y. Katona
Searching for f-Hamiltonian circuits. Comb. 12 (2) (1992)