
Search the dblp DataBase
Gyula Y. Katona:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Gyula Y. Katona
Searching for fHamiltonian circuits. [Citation Graph (0, 0)][DBLP] Combinatorica, 1992, v:12, n:2, pp:241246 [Journal]
 Douglas Bauer, Gyula Y. Katona, Dieter Kratsch, Henk Jan Veldman
Chordality and 2factors in Tough Graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2000, v:99, n:13, pp:323329 [Journal]
 Gyula Y. Katona
A large set of nonHamiltonian graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:115, n:13, pp:99115 [Journal]
 Gyula Y. Katona
Edge Disjoint Polyp Packing. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1997, v:78, n:13, pp:133152 [Journal]
 Aneta Dudek, Gyula Y. Katona, A. Pawel Wojda
Hamiltonian path saturated graphs with small size. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2006, v:154, n:9, pp:13721379 [Journal]
 Mikio Kano, Gyula Y. Katona
Odd subgraphs and matchings. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:250, n:13, pp:265272 [Journal]
 Mikio Kano, Gyula Y. Katona, Zoltán Király
Packing paths of length at least two. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:283, n:13, pp:129135 [Journal]
 Mikio Kano, Gyula Y. Katona
Structure theorem and algorithm on (1, f)odd subgraph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:1112, pp:14041417 [Journal]
 Gyula Y. Katona
Toughness and edgetoughness. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:164, n:13, pp:187196 [Journal]
Extremal Stable Graphs. [Citation Graph (, )][DBLP]
Extremal kedgehamiltonian hypergraphs. [Citation Graph (, )][DBLP]
Hamiltonchain saturated hypergraphs. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
