On the editing distance of graphs M Axenovich, A Kézdy, R Martin
Journal of Graph Theory 58 (2), 123-138, 2008
51 2008 Tough enough chordal graphs are hamiltonian G Chen, MS Jacobson, AE Kézdy, J Lehel
Networks: An International Journal 31 (1), 29-38, 1998
50 1998 Partitioning permutations into increasing and decreasing subsequences AE Kézdy, HS Snevily, C Wang
Journal of Combinatorial Theory, Series A 73 (2), 353-359, 1996
43 1996 Degree sequences of graphs with prescribed clique size AE Kézdy, J Lehel
Combinatorics, graph theory, and algorithms 2, 535-544, 1999
32 1999 Distinct sums modulo n and tree embeddings AE Kézdy, HS Snevily
Combinatorics, Probability and Computing 11 (1), 35-42, 2002
27 2002 Sequential and parallel algorithms to find a K5 minor A Kézdy, P McGuinness
Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms …, 1992
24 1992 Recognizing intersection graphs of linear uniform hypergraphs MS Jacobson, AE Kézdy, J Lehel
Graphs and Combinatorics 13 (4), 359-367, 1997
21 1997 Detour trees AS Jobson, AE Kézdy, J Lehel, SC White
Discrete Applied Mathematics 206, 73-80, 2016
19 2016 ρ-valuations for some stunted trees AE Kézdy
Discrete mathematics 306 (21), 2786-2789, 2006
15 2006 The poset on connected induced subgraphs of a graph need not be Sperner MS Jacobson, AE Kézdy, S Seif
Order 12, 315-318, 1995
15 1995 Do 3n − 5 edges force a subdivision of K 5 ? AE Kézdy, PJ McGuinness
Journal of graph theory 15 (4), 389-406, 1991
15 1991 Clique covering the edges of a locally cobipartite graph G Chen, MS Jacobson, AE Kézdy, J Lehel, ER Scheinerman, C Wang
Discrete Mathematics 219 (1-3), 17-26, 2000
14 2000 The path spectrum of a graph MS Jacobson, AE Kézdy, E Kubicka, G Kubicki, J Lehel, C Wang, ...
Congressus Numerantium, 49-64, 1995
13 1995 When is a poset isomorphic to the poset of connected induced subgraphs of a graph? A Kézdy, S Seif
Southwest Journal of Pure and Applied Mathematics [electronic only] 1, 42-50, 1996
12 1996 Scenic graphs I: traceable graphs MS Jacobson, AE Kezdy, J Lehel
Ars Combinatoria 49, 79-96, 1998
11 1998 Generalized Schur Numbers for AE Kézdy, HS Snevily, SC White
the electronic journal of combinatorics, R105-R105, 2009
10 2009 Scenic graphs II: non-traceable graphs MS Jacobson, AE Kezdy, J Lehel
Australasian Journal of Combinatorics 19, 287-307, 1999
9 1999 The 2‐intersection number of paths and bounded‐degree trees MS Jacobson, AE Kézdy, DB West
Journal of Graph Theory 19 (4), 461-469, 1995
9 1995 Odd cycles and Θ-cycles in hypergraphs A Gyárfás, MS Jacobson, AE Kézdy, J Lehel
Discrete mathematics 306 (19-20), 2481-2491, 2006
8 2006 Recognizing triangle‐free graphs with induced path‐cycle double covers is NP‐complete MS Jacobson, AE Kézdy, J Lehel
Networks: An International Journal 31 (1), 1-10, 1998
8 1998