The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jenö Lehel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Jenö Lehel, Inessa Levi
    Loops With Partitions and Matchings. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1999, v:54, n:, pp:- [Journal]
  3. András Gyárfás, Jenö Lehel
    Hypergraph families with bounded edge cover or transversal number. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1983, v:3, n:3, pp:351-358 [Journal]
  4. András Gyárfás, Jenö Lehel
    Effective on-line coloring of P5-free graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:2, pp:181-184 [Journal]
  5. András Gyárfás, Jenö Lehel, Zsolt Tuza
    How many atoms can be defined by boxes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:3, pp:193-204 [Journal]
  6. 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]
  7. Jenö Lehel
    Covers in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:3, pp:305-309 [Journal]
  8. Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
    Longest Paths in Circular Arc Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:3, pp:311-317 [Journal]
  9. Grzegorz Kubicki, Jenö Lehel, Michal Morayne
    A Ratio Inequality For Binary Trees And The Best Secretary. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2002, v:11, n:2, pp:- [Journal]
  10. Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
    Ø-Threshold and Ø-Tolerance Chain Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1993, v:44, n:1-3, pp:191-203 [Journal]
  11. Jenö Lehel, Frédéric Maffray, Myriam Preissmann
    Graphs with Largest Number of Minimum Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:387-407 [Journal]
  12. 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]
  13. Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel
    Edge disjoint monochromatic triangles in 2-colored graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:231, n:1-3, pp:135-141 [Journal]
  14. 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]
  15. Grzegorz Kubicki, Jenö Lehel
    Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:249, n:1-3, pp:1-0 [Journal]
  16. Mathew Cropper, András Gyárfás, Jenö Lehel
    Hall ratio of the Mycielski graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:16, pp:1988-1990 [Journal]
  17. 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]
  18. Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp
    Mono-multi bipartite Ramsey numbers, designs, and matrices. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:1, pp:101-112 [Journal]
  19. András Gyárfás, Jenö Lehel
    Linear Sets with Five Distinct Differences among Any Four Elements. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:64, n:1, pp:108-118 [Journal]
  20. András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
    Local k-colorings of graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:43, n:2, pp:127-139 [Journal]
  21. Grzegorz Kubicki, Jenö Lehel, Michal Morayne
    Patch Colorings and Rigid Colorings of the Rational n-Space. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:84, n:1, pp:45-53 [Journal]
  22. 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]
  23. 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]
  24. Grzegorz Kubicki, Jenö Lehel, Michal Morayne
    An Asymptotic Ratio in the Complete Binary Tree. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:2, pp:91-97 [Journal]
  25. Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West
    The Bar Visibility Number of a Graph. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:462-471 [Journal]
  26. András Gyárfás, Zoltán Király, Jenö Lehel
    On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1999, v:12, n:3, pp:385-411 [Journal]
  27. Paul N. Balister, Jenö Lehel, Richard H. Schelp
    Ramsey unsaturated and saturated graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:1, pp:22-32 [Journal]
  28. András Gyárfás, Jenö Lehel, Richard H. Schelp
    Finding a monochromatic subgraph or a rainbow path. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2007, v:54, n:1, pp:1-12 [Journal]
  29. Jenö Lehel, Zsolt Tuza
    Triangle-free partial graphs and edge covering theorems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:39, n:1, pp:59-65 [Journal]
  30. András Gyárfás, Jenö Lehel, Zsolt Tuza
    The structure of rectangle families dividing the plane into maximum number of atoms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:52, n:2-3, pp:177-198 [Journal]
  31. András Gyárfás, Jenö Lehel
    Covering and coloring problems for relatives of intervals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:167-180 [Journal]
  32. Jenö Lehel
    A characterization of totally balanced hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:57, n:1-2, pp:59-65 [Journal]
  33. Jenö Lehel, Zsolt Tuza
    Neighborhood perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:61, n:1, pp:93-101 [Journal]
  34. András Gyárfás, Jenö Lehel, Zsolt Tuza
    Clumsy packing of dominoes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:1, pp:33-46 [Journal]
  35. Jenö Lehel, Fred R. McMorris, Debra D. Scott
    M-chain graphs of posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:3, pp:341-346 [Journal]
  36. Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel
    Irregular networks, regular graphs and integer matrices with distinct row and column sums. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:76, n:3, pp:223-240 [Journal]
  37. András Gyárfás, Zoltán Király, Jenö Lehel
    On-line 3-chromatic graphs - II critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:177, n:1-3, pp:99-122 [Journal]
  38. Jenö Lehel
    The partition of a uniform hypergraph into pairs of dependent hyperedges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:313-318 [Journal]
  39. Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel
    Irregularity strength of dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:91, n:1, pp:45-59 [Journal]
  40. Lael F. Kinch, Jenö Lehel
    The irregularity strength of tP3. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:1, pp:75-79 [Journal]
  41. Michael S. Jacobson, Jenö Lehel
    Irregular embeddings of multigraphs with fixed chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:145, n:1-3, pp:295-299 [Journal]
  42. Michael S. Jacobson, Jenö Lehel
    Irregular embeddings of hypergraphs with fixed chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:145, n:1-3, pp:145-150 [Journal]
  43. Dieter Kratsch, Jenö Lehel, Haiko Müller
    Toughness, hamiltonicity and split graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:231-245 [Journal]
  44. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
    Graph spectra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:150, n:1-3, pp:103-113 [Journal]
  45. Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel
    On the rotation distance of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:121-135 [Journal]

  46. Maximum directed cuts in digraphs with degree restriction [Citation Graph (, )][DBLP]


  47. Connected graphs without long paths. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002