Gyula Y. Katona

49 papers C 2Journal 47
YearRankTypeTitle / Venue / Authors
2025 J jnl
Minimally tough series-parallel graphs with toughness at least 1/2.
CoRR
Gyula Y. Katona, Humara Khan
2024 J jnl
An Efficient Algorithm to Compute the Toughness in Graphs with Bounded Treewidth.
Graphs Comb.
Gyula Y. Katona, Humara Khan
2023 J jnl
Minimal toughness in special graph classes.
Discret. Math. Theor. Comput. Sci.
Gyula Y. Katona, Kitti Varga
2023 J jnl
Strengthening some complexity results on toughness of graphs.
Discuss. Math. Graph Theory
Gyula Y. Katona, Kitti Varga
2022 J jnl
Conditions for minimally tough graphs.
CoRR
Clément Dallard, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga
2022 J jnl
Minimally tough chordal graphs with toughness at most 1/2.
CoRR
Gyula Y. Katona, Humara Khan
2021 J jnl
The complexity of recognizing minimally tough graphs.
Discret. Appl. Math.
Gyula Y. Katona, István Kovács, Kitti Varga
2020 J jnl
Optimal Pebbling Number of the Square Grid.
Graphs Comb.
Ervin Györi, Gyula Y. Katona, László F. Papp
2019 J jnl
Optimal pebbling and rubbling of graphs with given diameter.
Discret. Appl. Math.
Ervin Györi, Gyula Y. Katona, László F. Papp
2019 J jnl
Optimal pebbling number of graphs with given minimum degree.
Discret. Appl. Math.
Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp
2019 J jnl
Strengthening some complexity results on toughness of graphs.
CoRR
Gyula Y. Katona, Kitti Varga
2019 J jnl
The optimal pebbling number of staircase graphs.
Discret. Math.
Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins
2018 J jnl
Decomposition of a Graph into Two Disjoint Odd Subgraphs.
Graphs Comb.
Mikio Kano, Gyula Y. Katona, Kitti Varga
2018 J jnl
Properties of minimally t-tough graphs.
Discret. Math.
Gyula Y. Katona, Daniel Soltész, Kitti Varga
2017 J jnl
BME VIK Annual Research Report on Electrical Engineering and Computer Science 2016.
Period. Polytech. Electr. Eng. Comput. Sci.
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
2017 J jnl
Constructions for the Optimal Pebbling of Grids.
Period. Polytech. Electr. Eng. Comput. Sci.
Ervin Györi, Gyula Y. Katona, László F. Papp
2017 J jnl
The complexity of recognizing minimally tough graphs.
CoRR
Gyula Y. Katona, István Kovács, Kitti Varga
2016 J jnl
Bounds on the number of edges in hypertrees.
Discret. Math.
Gyula Y. Katona, Péter G. N. Szabó
2016 J jnl
Hypergraph extensions of the Erdős-Gallai Theorem.
Eur. J. Comb.
Ervin Györi, Gyula Y. Katona, Nathan Lemons
2016 J jnl
The optimal rubbling number of ladders, prisms and Möbius-ladders.
Discret. Appl. Math.
Gyula Y. Katona, László F. Papp
2015 C conf
Optimal pebbling of grids.
CTW
Ervin Györi, Gyula Y. Katona, László F. Papp
2014 J jnl
Centrosymmetric graphs and a lower bound for graph energy of fullerenes.
Discuss. Math. Graph Theory
Ali Reza Ashrafi, Morteza Faghani, Gyula Y. Katona
2014 J jnl
Extension of paths and cycles for hypergraphs.
Electron. Notes Discret. Math.
Gyula Y. Katona
2013 J jnl
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs.
Graphs Comb.
Gyula Y. Katona, Nándor Sieben
2012 J jnl
Most Probably Intersecting Families of Subsets.
Comb. Probab. Comput.
Gyula O. H. Katona, Gyula Y. Katona, Zsolt Katona
2011 J jnl
Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs.
Electron. Notes Discret. Math.
Gyula Y. Katona, Nándor Sieben
2011 J jnl
Extremal P
Discret. Appl. Math.
Illés Horváth, Gyula Y. Katona
2010 J jnl
Hamilton-chain saturated hypergraphs.
Discret. Math.
Aneta Dudek, Andrzej Zak, Gyula Y. Katona
2010 J jnl
Hypergraph Extensions of the Erdos-Gallai Theorem.
Electron. Notes Discret. Math.
Ervin Györi, Gyula Y. Katona, Nathan Lemons
2009 J jnl
Breaking the hierarchy - a new cluster selection mechanism for hierarchical clustering methods.
Algorithms Mol. Biol.
László A. Zahoránszky, Gyula Y. Katona, Péter Hári, András Málnási-Csizmadia, Katharina A. Zweig, Gergely Zahoránszky-Köhalmi
2009 J jnl
Elementary Graphs with Respect to
Graphs Comb.
Mikio Kano, Gyula Y. Katona, Jácint Szabó
2009 C conf
Extremal Stable Graphs.
CTW
Gyula Y. Katona, Illés Horváth
2008 J jnl
Extremal k-edge-hamiltonian hypergraphs.
Discret. Math.
Peter Frankl, Gyula Y. Katona
2007 J jnl
Local Topological Toughness and Local Factors.
Graphs Comb.
Frank Göring, Gyula Y. Katona
2007 J jnl
Structure theorem and algorithm on (1, f)-odd subgraph.
Discret. Math.
Mikio Kano, Gyula Y. Katona
2006 J jnl
Hamiltonian Chains in Hypergraphs.
Electron. Notes Discret. Math.
Gyula Y. Katona
2006 J jnl
Hamiltonian path saturated graphs with small size.
Discret. Appl. Math.
Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda
2004 J jnl
Packing paths of length at least two.
Discret. Math.
Mikio Kano, Gyula Y. Katona, Zoltán Király
2003 J jnl
m_Path Cover Saturated Graphs.
Electron. Notes Discret. Math.
Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda
2002 J jnl
Odd subgraphs and matchings.
Discret. Math.
Mikio Kano, Gyula Y. Katona
2001 J jnl
A large set of non-Hamiltonian graphs.
Discret. Appl. Math.
Gyula Y. Katona
2001 J jnl
Extremal k-edge-hamiltonian Hypergraphs.
Electron. Notes Discret. Math.
Peter Frankl, Gyula Y. Katona
2000 J jnl
Chordality and 2-factors in Tough Graphs.
Discret. Appl. Math.
Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
2000 J jnl
Extremal k-edge-hamiltonian Hypergraphs.
Electron. Notes Discret. Math.
Peter Frankl, Gyula Y. Katona
1999 J jnl
Hamiltonian chains in hypergraphs.
J. Graph Theory
Gyula Y. Katona, Hal A. Kierstead
1999 J jnl
Properties of Edge-Tough Graphs.
Graphs Comb.
Gyula Y. Katona
1997 J jnl
Edge Disjoint Polyp Packing.
Discret. Appl. Math.
Gyula Y. Katona
1997 J jnl
Toughness and edge-toughness.
Discret. Math.
Gyula Y. Katona
1992 J jnl
Searching for f-Hamiltonian circuits.
Comb.
Gyula Y. Katona