Gyula Y. Katona

According to our database, Gyula Y. Katona authored at least 40 papers between 1992 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Strengthening some complexity results on toughness of graphs.

Gyula Y. Katona, Kitti Varga

Discuss. Math. Graph Theory, 2023

2022

Conditions for minimally tough graphs.

Clément Dallard, Blas Fernández, Gyula Y. Katona, Martin Milanic, Kitti Varga

CoRR, 2022

Minimally tough chordal graphs with toughness at most 1/2.

Gyula Y. Katona, Humara Khan

CoRR, 2022

2021

The complexity of recognizing minimally tough graphs.

Gyula Y. Katona, István Kovács, Kitti Varga

Discret. Appl. Math., 2021

2020

Optimal Pebbling Number of the Square Grid.

Ervin Györi, Gyula Y. Katona, László F. Papp

Graphs Comb., 2020

2019

The optimal pebbling number of staircase graphs.

Ervin Györi, Gyula Y. Katona, László F. Papp, Casey Tompkins

Discret. Math., 2019

Optimal pebbling and rubbling of graphs with given diameter.

Ervin Györi, Gyula Y. Katona, László F. Papp

Discret. Appl. Math., 2019

Optimal pebbling number of graphs with given minimum degree.

Andrzej Czygrinow, Glenn Hurlbert, Gyula Y. Katona, László F. Papp

Discret. Appl. Math., 2019

2018

Decomposition of a Graph into Two Disjoint Odd Subgraphs.

Mikio Kano, Gyula Y. Katona, Kitti Varga

Graphs Comb., 2018

Properties of minimally t-tough graphs.

Gyula Y. Katona, Daniel Soltész, Kitti Varga

Discret. Math., 2018

2017

Constructions for the Optimal Pebbling of Grids.

Ervin Györi, Gyula Y. Katona, László F. Papp

Period. Polytech. Electr. Eng. Comput. Sci., 2017

BME VIK Annual Research Report on Electrical Engineering and Computer Science 2016.

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

Period. Polytech. Electr. Eng. Comput. Sci., 2017

2016

Bounds on the number of edges in hypertrees.

Gyula Y. Katona, Péter G. N. Szabó

Discret. Math., 2016

The optimal rubbling number of ladders, prisms and Möbius-ladders.

Gyula Y. Katona, László F. Papp

Discret. Appl. Math., 2016

2015

Optimal pebbling of grids.

Ervin Györi, Gyula Y. Katona, László F. Papp

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2014

Extension of paths and cycles for hypergraphs.

Gyula Y. Katona

Electron. Notes Discret. Math., 2014

Centrosymmetric graphs and a lower bound for graph energy of fullerenes.

Ali Reza Ashrafi, Morteza Faghani, Gyula Y. Katona

Discuss. Math. Graph Theory, 2014

2012

Most Probably Intersecting Families of Subsets.

Gyula O. H. Katona, Gyula Y. Katona, Zsolt Katona

Comb. Probab. Comput., 2012

2011

Bounds on the Rubbling and Optimal Rubbling Numbers of Graphs.

Gyula Y. Katona, Nándor Sieben

Electron. Notes Discret. Math., 2011

Extremal P₄-stable graphs.

Illés Horváth, Gyula Y. Katona

Discret. Appl. Math., 2011

2010

Hypergraph Extensions of the Erdos-Gallai Theorem.

Ervin Györi, Gyula Y. Katona, Nathan Lemons

Electron. Notes Discret. Math., 2010

Hamilton-chain saturated hypergraphs.

Aneta Dudek, Andrzej Zak, Gyula Y. Katona

Discret. Math., 2010

2009

Elementary Graphs with Respect to <i>f</i>-Parity Factors.

Mikio Kano, Gyula Y. Katona, Jácint Szabó

Graphs Comb., 2009

Breaking the hierarchy - a new cluster selection mechanism for hierarchical clustering methods.

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

Algorithms Mol. Biol., 2009

Extremal Stable Graphs.

Gyula Y. Katona, Illés Horváth

Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2007

Local Topological Toughness and Local Factors.

Frank Göring, Gyula Y. Katona

Graphs Comb., 2007

Structure theorem and algorithm on (1, f)-odd subgraph.

Mikio Kano, Gyula Y. Katona

Discret. Math., 2007

2006

Hamiltonian Chains in Hypergraphs.

Gyula Y. Katona

Electron. Notes Discret. Math., 2006

Hamiltonian path saturated graphs with small size.

Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda

Discret. Appl. Math., 2006

2004

Packing paths of length at least two.

Mikio Kano, Gyula Y. Katona, Zoltán Király

Discret. Math., 2004

2003

m_Path Cover Saturated Graphs.

Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda

Electron. Notes Discret. Math., 2003

2002

Odd subgraphs and matchings.

Mikio Kano, Gyula Y. Katona

Discret. Math., 2002

2001

Extremal k-edge-hamiltonian Hypergraphs.

Peter Frankl, Gyula Y. Katona

Electron. Notes Discret. Math., 2001

A large set of non-Hamiltonian graphs.

Gyula Y. Katona

Discret. Appl. Math., 2001

2000

Chordality and 2-factors in Tough Graphs.

Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman

Discret. Appl. Math., 2000

1999

Hamiltonian chains in hypergraphs.

Gyula Y. Katona, Hal A. Kierstead

J. Graph Theory, 1999

Properties of Edge-Tough Graphs.

Gyula Y. Katona

Graphs Comb., 1999

1997

Toughness and edge-toughness.

Gyula Y. Katona

Discret. Math., 1997

Edge Disjoint Polyp Packing.

Gyula Y. Katona

Discret. Appl. Math., 1997

1992

Searching for f-Hamiltonian circuits.

Gyula Y. Katona

Comb., 1992