 | 2009 |
|---|
| 15 |       | Gyula Y. Katona,
Illés Horváth:
Extremal Stable Graphs.
CTW 2009: 149-152 |
| 2008 |
|---|
| 14 | | Peter Frankl,
Gyula Y. Katona:
Extremal k-edge-hamiltonian hypergraphs.
Discrete Mathematics 308(8): 1415-1424 (2008) |
| 2007 |
|---|
| 13 | | Mikio Kano,
Gyula Y. Katona:
Structure theorem and algorithm on (1, f)-odd subgraph.
Discrete Mathematics 307(11-12): 1404-1417 (2007) |
| 2006 |
|---|
| 12 | | Aneta Dudek,
Gyula Y. Katona,
A. Pawel Wojda:
Hamiltonian path saturated graphs with small size.
Discrete Applied Mathematics 154(9): 1372-1379 (2006) |
| 11 | | Gyula Y. Katona:
Hamiltonian Chains in Hypergraphs.
Electronic Notes in Discrete Mathematics 25: 81-87 (2006) |
| 2004 |
|---|
| 10 | | Mikio Kano,
Gyula Y. Katona,
Zoltán Király:
Packing paths of length at least two.
Discrete Mathematics 283(1-3): 129-135 (2004) |
| 2003 |
|---|
| 9 | | Aneta Dudek,
Gyula Y. Katona,
A. Pawel Wojda:
m_Path Cover Saturated Graphs.
Electronic Notes in Discrete Mathematics 13: 41-44 (2003) |
| 2002 |
|---|
| 8 | | Mikio Kano,
Gyula Y. Katona:
Odd subgraphs and matchings.
Discrete Mathematics 250(1-3): 265-272 (2002) |
| 2001 |
|---|
| 7 |  | Gyula Y. Katona:
A large set of non-Hamiltonian graphs.
Discrete Applied Mathematics 115(1-3): 99-115 (2001) |
| 6 | | Peter Frankl,
Gyula Y. Katona:
Extremal k-edge-hamiltonian Hypergraphs.
Electronic Notes in Discrete Mathematics 10: 109-112 (2001) |
| 2000 |
|---|
| 5 | | Douglas Bauer,
Gyula Y. Katona,
Dieter Kratsch,
Henk Jan Veldman:
Chordality and 2-factors in Tough Graphs.
Discrete Applied Mathematics 99(1-3): 323-329 (2000) |
| 4 | | Peter Frankl,
Gyula Y. Katona:
Extremal k-edge-hamiltonian Hypergraphs.
Electronic Notes in Discrete Mathematics 5: 130-133 (2000) |
| 1997 |
|---|
| 3 | | Gyula Y. Katona:
Edge Disjoint Polyp Packing.
Discrete Applied Mathematics 78(1-3): 133-152 (1997) |
| 2 | | Gyula Y. Katona:
Toughness and edge-toughness.
Discrete Mathematics 164(1-3): 187-196 (1997) |
| 1992 |
|---|
| 1 | | Gyula Y. Katona:
Searching for f-Hamiltonian circuits.
Combinatorica 12(2): 241-246 (1992) |
