Search the dblp DataBase
André E. Kézdy :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
André E. Kézdy , Patrick McGuinness Sequential and Parallel Algorithms to Find a K5 Minor. [Citation Graph (0, 0)][DBLP ] SODA, 1992, pp:345-356 [Conf ] Michael S. Jacobson , André E. Kézdy , Jenö Lehel Scenic Graphs I: Traceable Graphs. [Citation Graph (0, 0)][DBLP ] Ars Comb., 1998, v:49, n:, pp:- [Journal ] André E. Kézdy , Jenö Lehel , Robert C. Powers Heavy Transversals and Indecomposable Hypergraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2003, v:23, n:2, pp:303-310 [Journal ] André E. Kézdy , Hunter S. Snevily Distinct Sums Modulo N And Tree Embeddings. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2002, v:11, n:1, pp:- [Journal ] André E. Kézdy , Hunter S. Snevily Polynomials that Vanish on Distinct nth Roots of Unity. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2004, v:13, n:1, pp:37-59 [Journal ] Guantao Chen , Michael S. Jacobson , André E. Kézdy , Jenö Lehel , Edward R. Scheinerman , Chi Wang Clique covering the edges of a locally cobipartite graph. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2000, v:219, n:1-3, pp:17-26 [Journal ] András Gyárfás , André E. Kézdy , Jenö Lehel A finite basis characterization of ?-split colorings. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:257, n:2-3, pp:415-421 [Journal ] André E. Kézdy , Matthew Scobee A proof of Hougardy's conjecture for diamond-free graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:240, n:1-3, pp:83-95 [Journal ] André E. Kézdy rho-Valuations for some stunted trees. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:21, pp:2786-2789 [Journal ] András Gyárfás , Michael S. Jacobson , André E. Kézdy , Jenö Lehel Odd cycles and Theta-cycles in hypergraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:19-20, pp:2481-2491 [Journal ] André E. Kézdy , Hunter S. Snevily On Extensions of a Conjecture of Gallai. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1997, v:70, n:2, pp:317-324 [Journal ] André E. Kézdy , Hunter S. Snevily , Chi Wang Partitioning Permutations into Increasing and Decreasing Subsequences. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:73, n:2, pp:353-359 [Journal ] Guantao Chen , Michael S. Jacobson , André E. Kézdy , Jenö Lehel Tough enough chordal graphs are Hamiltonian. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:1, pp:29-38 [Journal ] Michael S. Jacobson , André E. Kézdy , Jenö Lehel Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. [Citation Graph (0, 0)][DBLP ] Networks, 1998, v:31, n:1, pp:1-10 [Journal ] André E. Kézdy , Chi Wang Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:194, n:1-3, pp:261-265 [Journal ] Search in 0.002secs, Finished in 0.002secs