Jenö Lehel

Publication Activity (10 Years)

Years Active: 1980-2016
Publications (10 Years): 3

Top Topics

Tree Construction

Multiresolution

Combinatorial Problems

Top Venues

SIAM J. Discret. Math.

Discret. Appl. Math.

Publications

Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. Graphs Comb. 32 (3) (2016)
Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
Random Hypergraph Irregularity. SIAM J. Discret. Math. 30 (1) (2016)
Adam S. Jobson, André E. Kézdy, Jenö Lehel, Susan C. White
Detour trees. Discret. Appl. Math. 206 (2016)
Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. 27 (1) (2013)
András Gyárfás, Jenö Lehel
Trees in greedy colorings of hypergraphs. Discret. Math. 311 (2-3) (2011)
Mathew Cropper, Anthony J. W. Hilton, Peter D. Johnson Jr., Jenö Lehel
-fold Hall numbers. J. Graph Theory 65 (1) (2010)
Zoltán Füredi, Jenö Lehel
Tight embeddings of partial quadrilateral packings. J. Comb. Theory, Ser. A 117 (4) (2010)
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
Maximum directed cuts in digraphs with degree restriction. J. Graph Theory 61 (2) (2009)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Connected graphs without long paths. Discret. Math. 308 (19) (2008)
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) (2008)
Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
Maximum directed cuts in acyclic digraphs. J. Graph Theory 55 (1) (2007)
András Gyárfás, Jenö Lehel, Richard H. Schelp
Finding a monochromatic subgraph or a rainbow path. J. Graph Theory 54 (1) (2007)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. 21 (1) (2007)
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
Maximum directed cuts in digraphs with degree restriction CoRR (2007)
Paul N. Balister, Jenö Lehel, Richard H. Schelp
Ramsey unsaturated and saturated graphs. J. Graph Theory 51 (1) (2006)
Mathew Cropper, András Gyárfás, Jenö Lehel
Hall ratio of the Mycielski graphs. Discret. Math. 306 (16) (2006)
András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Odd cycles and Theta-cycles in hypergraphs. Discret. Math. 306 (19-20) (2006)
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) (2006)
Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. 13 (3) (2004)
Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West
The Bar Visibility Number of a Graph. SIAM J. Discret. Math. 18 (3) (2004)
André E. Kézdy, Jenö Lehel, Robert C. Powers
Heavy Transversals and Indecomposable Hypergraphs. Comb. 23 (2) (2003)
Mathew Cropper, András Gyárfás, Jenö Lehel
Edge list multicoloring trees: An extension of Hall's theorem. J. Graph Theory 42 (3) (2003)
Grzegorz Kubicki, Jenö Lehel, Michal Morayne
An Asymptotic Ratio in the Complete Binary Tree. Order 20 (2) (2003)
András Gyárfás, André E. Kézdy, Jenö Lehel
A finite basis characterization of ?-split colorings. Discret. Math. 257 (2-3) (2002)
Grzegorz Kubicki, Jenö Lehel, Michal Morayne
A Ratio Inequality For Binary Trees And The Best Secretary. Comb. Probab. Comput. 11 (2) (2002)
Grzegorz Kubicki, Jenö Lehel, Michal Morayne
Patch Colorings and Rigid Colorings of the Rational n-Space. J. Comb. Theory, Ser. B 84 (1) (2002)
Grzegorz Kubicki, Jenö Lehel
Foreword. Discret. Math. 249 (1-3) (2002)
Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel
Edge disjoint monochromatic triangles in 2-colored graphs. Discret. Math. 231 (1-3) (2001)
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. Discret. Math. 219 (1-3) (2000)
András Gyárfás, Zoltán Király, Jenö Lehel
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. SIAM J. Discret. Math. 12 (3) (1999)
Jenö Lehel, Inessa Levi
Loops With Partitions and Matchings. Ars Comb. 54 (1999)
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Scenic Graphs I: Traceable Graphs. Ars Comb. 49 (1998)
Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Tough enough chordal graphs are Hamiltonian. Networks 31 (1) (1998)
Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve
Note on graphs without repeated cycle lengths. J. Graph Theory 29 (1) (1998)
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) (1998)
Jenö Lehel
The partition of a uniform hypergraph into pairs of dependent hyperedges. Discret. Math. 163 (1-3) (1997)
Michael S. Jacobson, André E. Kézdy, Jenö Lehel
Recognizing Intersection Graphs of Linear Uniform Hypergraphs. Graphs Comb. 13 (4) (1997)
András Gyárfás, Zoltán Király, Jenö Lehel
On-line 3-chromatic graphs - II critical graphs. Discret. Math. 177 (1-3) (1997)
Jenö Lehel, Frédéric Maffray, Myriam Preissmann
Graphs with Largest Number of Minimum Cuts. Discret. Appl. Math. 65 (1-3) (1996)
Dieter Kratsch, Jenö Lehel, Haiko Müller
Toughness, hamiltonicity and split graphs. Discret. Math. 150 (1-3) (1996)
Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
Graph spectra. Discret. Math. 150 (1-3) (1996)
András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray
Minimal non-neighborhood-perfect graphs. J. Graph Theory 21 (1) (1996)
András Gyárfás, Jenö Lehel
Linear Sets with Five Distinct Differences among Any Four Elements. J. Comb. Theory, Ser. B 64 (1) (1995)
Michael S. Jacobson, Jenö Lehel
Irregular embeddings of multigraphs with fixed chromatic number. Discret. Math. 145 (1-3) (1995)
Michael S. Jacobson, Jenö Lehel
Irregular embeddings of hypergraphs with fixed chromatic number. Discret. Math. 145 (1-3) (1995)
Jenö Lehel
Neighbourhood-Perfect Line Graphs. Graphs Comb. 10 (2-4) (1994)
Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel
On the rotation distance of graphs. Discret. Math. 126 (1-3) (1994)
Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
Ø-Threshold and Ø-Tolerance Chain Graphs. Discret. Appl. Math. 44 (1-3) (1993)
László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp
Networks communicating for each pairing of terminals. Networks 22 (7) (1992)
Ralph J. Faudree, András Gyárfás, Jenö Lehel
Three-regular path pairable graphs. Graphs Comb. 8 (1) (1992)
András Gyárfás, Jenö Lehel
-free graphs. Comb. 11 (2) (1991)
Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel
Irregularity strength of dense graphs. Discret. Math. 91 (1) (1991)
Lael F. Kinch, Jenö Lehel
. Discret. Math. 94 (1) (1991)
Jenö Lehel
The minimum number of triangles covering the edges of a graph. J. Graph Theory 13 (3) (1989)
Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel
Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discret. Math. 76 (3) (1989)
Jenö Lehel, Fred R. McMorris, Debra D. Scott
M-chain graphs of posets. Discret. Math. 74 (3) (1989)
András Gyárfás, Jenö Lehel
On-line and first fit colorings of graphs. J. Graph Theory 12 (2) (1988)
András Gyárfás, Jenö Lehel, Zsolt Tuza
Clumsy packing of dominoes. Discret. Math. 71 (1) (1988)
Jenö Lehel
Gallai-type Results for Multiple Boxes and Forests. Eur. J. Comb. 9 (2) (1988)
Imre Bárány, Jenö Lehel
Covering with Euclidean Boxes. Eur. J. Comb. 8 (2) (1987)
András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
-colorings of graphs and hypergraphs. J. Comb. Theory, Ser. B 43 (2) (1987)
Jenö Lehel, Zsolt Tuza
Neighborhood perfect graphs. Discret. Math. 61 (1) (1986)
András Gyárfás, Jenö Lehel
Covering and coloring problems for relatives of intervals. Discret. Math. 55 (2) (1985)
Jenö Lehel
A characterization of totally balanced hypergraphs. Discret. Math. 57 (1-2) (1985)
András Gyárfás, Jenö Lehel, Zsolt Tuza
How many atoms can be defined by boxes. Comb. 5 (3) (1985)
András Gyárfás, Jenö Lehel, Zsolt Tuza
The structure of rectangle families dividing the plane into maximum number of atoms. Discret. Math. 52 (2-3) (1984)
András Gyárfás, Jenö Lehel
Hypergraph families with bounded edge cover or transversal number. Comb. 3 (3) (1983)
Jenö Lehel, Zsolt Tuza
Triangle-free partial graphs and edge covering theorems. Discret. Math. 39 (1) (1982)
Jenö Lehel
Covers in hypergraphs. Comb. 2 (3) (1982)
Jenö Lehel
Generating all 4-regular planar graphs from the graph of the octahedron. J. Graph Theory 5 (4) (1981)
Jenö Lehel, Zsolt Tuza
Ensembles d'articulation d'un graphe γ-critique. Discret. Math. 30 (3) (1980)
Jenö Lehel
Deltahedra are realizable as simplicial convex polyhedra. Discret. Appl. Math. 2 (1) (1980)