Jeno Lehel
List of publications from the DBLP Bibliography Server - FAQ
2008 | ||
---|---|---|
51 | EE | Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Connected graphs without long paths. Discrete Mathematics 308(19): 4487-4494 (2008) |
50 | EE | András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp: Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Comb. Theory, Ser. B 98(2): 342-358 (2008) |
2007 | ||
49 | EE | Jenö Lehel, Frédéric Maffray, Myriam Preissmann: Maximum directed cuts in digraphs with degree restriction CoRR abs/0711.3958: (2007) |
48 | EE | András Gyárfás, Jenö Lehel, Richard H. Schelp: Finding a monochromatic subgraph or a rainbow path. Journal of Graph Theory 54(1): 1-12 (2007) |
47 | EE | Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott: Maximum directed cuts in acyclic digraphs. Journal of Graph Theory 55(1): 1-13 (2007) |
46 | EE | Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discrete Math. 21(1): 237-250 (2007) |
2006 | ||
45 | Grzegorz Kubicki, Jeno Lehel, Michal Morayne: Counting chains and antichains in the complete binary tree. Ars Comb. 79: (2006) | |
44 | EE | Mathew Cropper, András Gyárfás, Jenö Lehel: Hall ratio of the Mycielski graphs. Discrete Mathematics 306(16): 1988-1990 (2006) |
43 | EE | András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Odd cycles and Theta-cycles in hypergraphs. Discrete Mathematics 306(19-20): 2481-2491 (2006) |
42 | EE | Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp: Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory, Ser. A 113(1): 101-112 (2006) |
41 | EE | Paul N. Balister, Jenö Lehel, Richard H. Schelp: Ramsey unsaturated and saturated graphs. Journal of Graph Theory 51(1): 22-32 (2006) |
2004 | ||
40 | Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp: Longest Paths in Circular Arc Graphs. Combinatorics, Probability & Computing 13(3): 311-317 (2004) | |
39 | EE | Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West: The Bar Visibility Number of a Graph. SIAM J. Discrete Math. 18(3): 462-471 (2004) |
2003 | ||
38 | EE | André E. Kézdy, Jenö Lehel, Robert C. Powers: Heavy Transversals and Indecomposable Hypergraphs. Combinatorica 23(2): 303-310 (2003) |
37 | EE | Grzegorz Kubicki, Jenö Lehel, Michal Morayne: An Asymptotic Ratio in the Complete Binary Tree. Order 20(2): 91-97 (2003) |
2002 | ||
36 | Grzegorz Kubicki, Jenö Lehel, Michal Morayne: A Ratio Inequality For Binary Trees And The Best Secretary. Combinatorics, Probability & Computing 11(2): (2002) | |
35 | EE | Grzegorz Kubicki, Jenö Lehel: Foreword. Discrete Mathematics 249(1-3): 1- (2002) |
34 | EE | András Gyárfás, André E. Kézdy, Jenö Lehel: A finite basis characterization of ?-split colorings. Discrete Mathematics 257(2-3): 415-421 (2002) |
33 | EE | Grzegorz Kubicki, Jenö Lehel, Michal Morayne: Patch Colorings and Rigid Colorings of the Rational n-Space. J. Comb. Theory, Ser. B 84(1): 45-53 (2002) |
2001 | ||
32 | EE | Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel: Edge disjoint monochromatic triangles in 2-colored graphs. Discrete Mathematics 231(1-3): 135-141 (2001) |
2000 | ||
31 | EE | 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. Discrete Mathematics 219(1-3): 17-26 (2000) |
1999 | ||
30 | Jenö Lehel, Inessa Levi: Loops With Partitions and Matchings. Ars Comb. 54: (1999) | |
29 | EE | András Gyárfás, Zoltán Király, Jenö Lehel: On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. SIAM J. Discrete Math. 12(3): 385-411 (1999) |
1998 | ||
28 | Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Scenic Graphs I: Traceable Graphs. Ars Comb. 49: (1998) | |
27 | EE | Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. Networks 31(1): 1-10 (1998) |
26 | EE | Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel: Tough enough chordal graphs are Hamiltonian. Networks 31(1): 29-38 (1998) |
1997 | ||
25 | EE | Jenö Lehel: The partition of a uniform hypergraph into pairs of dependent hyperedges. Discrete Mathematics 163(1-3): 313-318 (1997) |
24 | EE | András Gyárfás, Zoltán Király, Jenö Lehel: On-line 3-chromatic graphs - II critical graphs. Discrete Mathematics 177(1-3): 99-122 (1997) |
1996 | ||
23 | EE | Jenö Lehel, Frédéric Maffray, Myriam Preissmann: Graphs with Largest Number of Minimum Cuts. Discrete Applied Mathematics 65(1-3): 387-407 (1996) |
22 | EE | Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak: Graph spectra. Discrete Mathematics 150(1-3): 103-113 (1996) |
21 | EE | Dieter Kratsch, Jenö Lehel, Haiko Müller: Toughness, hamiltonicity and split graphs. Discrete Mathematics 150(1-3): 231-245 (1996) |
1995 | ||
20 | EE | Michael S. Jacobson, Jenö Lehel: Irregular embeddings of hypergraphs with fixed chromatic number. Discrete Mathematics 145(1-3): 145-150 (1995) |
19 | EE | Michael S. Jacobson, Jenö Lehel: Irregular embeddings of multigraphs with fixed chromatic number. Discrete Mathematics 145(1-3): 295-299 (1995) |
18 | EE | András Gyárfás, Jenö Lehel: Linear Sets with Five Distinct Differences among Any Four Elements. J. Comb. Theory, Ser. B 64(1): 108-118 (1995) |
1994 | ||
17 | EE | Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel: On the rotation distance of graphs. Discrete Mathematics 126(1-3): 121-135 (1994) |
1993 | ||
16 | EE | Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak: Ø-Threshold and Ø-Tolerance Chain Graphs. Discrete Applied Mathematics 44(1-3): 191-203 (1993) |
1991 | ||
15 | András Gyárfás, Jenö Lehel: Effective on-line coloring of P5-free graphs. Combinatorica 11(2): 181-184 (1991) | |
14 | EE | Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel: Irregularity strength of dense graphs. Discrete Mathematics 91(1): 45-59 (1991) |
13 | EE | Lael F. Kinch, Jenö Lehel: The irregularity strength of tP3. Discrete Mathematics 94(1): 75-79 (1991) |
1989 | ||
12 | EE | Jenö Lehel, Fred R. McMorris, Debra D. Scott: M-chain graphs of posets. Discrete Mathematics 74(3): 341-346 (1989) |
11 | EE | Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel: Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discrete Mathematics 76(3): 223-240 (1989) |
1988 | ||
10 | EE | András Gyárfás, Jenö Lehel, Zsolt Tuza: Clumsy packing of dominoes. Discrete Mathematics 71(1): 33-46 (1988) |
1987 | ||
9 | EE | András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza: Local k-colorings of graphs and hypergraphs. J. Comb. Theory, Ser. B 43(2): 127-139 (1987) |
1986 | ||
8 | EE | Jenö Lehel, Zsolt Tuza: Neighborhood perfect graphs. Discrete Mathematics 61(1): 93-101 (1986) |
1985 | ||
7 | András Gyárfás, Jenö Lehel, Zsolt Tuza: How many atoms can be defined by boxes. Combinatorica 5(3): 193-204 (1985) | |
6 | EE | András Gyárfás, Jenö Lehel: Covering and coloring problems for relatives of intervals. Discrete Mathematics 55(2): 167-180 (1985) |
5 | EE | Jenö Lehel: A characterization of totally balanced hypergraphs. Discrete Mathematics 57(1-2): 59-65 (1985) |
1984 | ||
4 | EE | András Gyárfás, Jenö Lehel, Zsolt Tuza: The structure of rectangle families dividing the plane into maximum number of atoms. Discrete Mathematics 52(2-3): 177-198 (1984) |
1983 | ||
3 | András Gyárfás, Jenö Lehel: Hypergraph families with bounded edge cover or transversal number. Combinatorica 3(3): 351-358 (1983) | |
1982 | ||
2 | Jenö Lehel: Covers in hypergraphs. Combinatorica 2(3): 305-309 (1982) | |
1 | EE | Jenö Lehel, Zsolt Tuza: Triangle-free partial graphs and edge covering theorems. Discrete Mathematics 39(1): 59-65 (1982) |