Jenö Lehel

According to our database, Jenö Lehel authored at least 91 papers between 1980 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2023

Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph.

Csaba Biró, Jeno Lehel, Géza Tóth

Order, October, 2023

An asymptotic resolution of a conjecture of Szemerédi and Petruska.

André E. Kézdy, Jeno Lehel

Discret. Math., August, 2023

2021

Path-pairability of infinite planar grids.

Adam S. Jobson, André E. Kézdy, Jeno Lehel

Period. Math. Hung., 2021

Order plus size of 𝜏-critical graphs.

András Gyárfás, Jeno Lehel

J. Graph Theory, 2021

Minimal 2-connected graphs satisfying the even cut condition.

Adam S. Jobson, André E. Kézdy, Jeno Lehel

Inf. Process. Lett., 2021

Eckhoff's Problem on Convex Sets in the Plane.

Adam S. Jobson, André E. Kézdy, Jeno Lehel

Electron. J. Comb., 2021

2020

Petruska's question on planar convex sets.

Adam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth

Discret. Math., 2020

Note on the bisection width of cubic graphs.

Adam S. Jobson, André E. Kézdy, Jeno Lehel

Discret. Appl. Math., 2020

2019

The path-pairability number of products of stars.

Adam S. Jobson, André E. Kézdy, Jeno Lehel, Gábor Mészáros

Discuss. Math. Graph Theory, 2019

2018

Linkage on the infinite grid.

Adam S. Jobson, André E. Kézdy, Jeno Lehel

Inf. Process. Lett., 2018

A panconnectivity theorem for bipartite graphs.

Hui Du, Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto

Discret. Math., 2018

The minimum size of graphs satisfying cut conditions.

Adam S. Jobson, André E. Kézdy, Jeno Lehel

Discret. Appl. Math., 2018

2016

Random Hypergraph Irregularity.

Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne

SIAM J. Discret. Math., 2016

Vertex Coloring of Graphs by Total 2-Weightings.

Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto

Graphs Comb., 2016

Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs.

Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto

Graphs Comb., 2016

Ramsey number of paths and connected matchings in Ore-type host graphs.

János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy

Discret. Math., 2016

Detour trees.

Adam S. Jobson, André E. Kézdy, Jenö Lehel, Susan C. White

Discret. Appl. Math., 2016

Red-Blue Clique Partitions and (1-1)-Transversals.

András Gyárfás, Jeno Lehel

Electron. J. Comb., 2016

2014

Note on Locating Pairs of Vertices on Hamiltonian Cycles.

Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto

Graphs Comb., 2014

2013

Repeated Degrees in Random Uniform Hypergraphs.

Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne

SIAM J. Discret. Math., 2013

2011

Trees in greedy colorings of hypergraphs.

András Gyárfás, Jenö Lehel

Discret. Math., 2011

2010

List multicoloring problems involving the <i>k</i>-fold Hall numbers.

Mathew Cropper, Anthony J. W. Hilton, Peter D. Johnson Jr., Jenö Lehel

J. Graph Theory, 2010

Tight embeddings of partial quadrilateral packings.

Zoltán Füredi, Jenö Lehel

J. Comb. Theory, Ser. A, 2010

2009

Maximum directed cuts in digraphs with degree restriction.

Jenö Lehel, Frédéric Maffray, Myriam Preissmann

J. Graph Theory, 2009

2008

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.

András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp

J. Comb. Theory, Ser. B, 2008

Connected graphs without long paths.

Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp

Discret. Math., 2008

2007

Adjacent Vertex Distinguishing Edge-Colorings.

Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp

SIAM J. Discret. Math., 2007

Finding a monochromatic subgraph or a rainbow path.

András Gyárfás, Jenö Lehel, Richard H. Schelp

J. Graph Theory, 2007

Maximum directed cuts in acyclic digraphs.

Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott

J. Graph Theory, 2007

2006

Ramsey unsaturated and saturated graphs.

Paul N. Balister, Jenö Lehel, Richard H. Schelp

J. Graph Theory, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.

Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp

J. Comb. Theory, Ser. A, 2006

Odd cycles and Theta-cycles in hypergraphs.

András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Discret. Math., 2006

Hall ratio of the Mycielski graphs.

Mathew Cropper, András Gyárfás, Jenö Lehel

Discret. Math., 2006

Counting chains and antichains in the complete binary tree.

Grzegorz Kubicki, Jeno Lehel, Michal Morayne

Ars Comb., 2006

2004

The Bar Visibility Number of a Graph.

Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West

SIAM J. Discret. Math., 2004

Longest Paths in Circular Arc Graphs.

Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp

Comb. Probab. Comput., 2004

2003

An Asymptotic Ratio in the Complete Binary Tree.

Grzegorz Kubicki, Jenö Lehel, Michal Morayne

Order, 2003

Edge list multicoloring trees: An extension of Hall's theorem.

Mathew Cropper, András Gyárfás, Jenö Lehel

J. Graph Theory, 2003

Heavy Transversals and Indecomposable Hypergraphs.

André E. Kézdy, Jenö Lehel, Robert C. Powers

Comb., 2003

2002

Patch Colorings and Rigid Colorings of the Rational n-Space.

Grzegorz Kubicki, Jenö Lehel, Michal Morayne

J. Comb. Theory, Ser. B, 2002

Foreword.

Grzegorz Kubicki, Jenö Lehel

Discret. Math., 2002

A finite basis characterization of ?-split colorings.

András Gyárfás, André E. Kézdy, Jenö Lehel

Discret. Math., 2002

A Ratio Inequality For Binary Trees And The Best Secretary.

Grzegorz Kubicki, Jenö Lehel, Michal Morayne

Comb. Probab. Comput., 2002

2001

Edge disjoint monochromatic triangles in 2-colored graphs.

Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel

Discret. Math., 2001

2000

Even Cycles in Graphs with Many Odd Cycles.

Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp

Graphs Comb., 2000

Clique covering the edges of a locally cobipartite graph.

Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang

Discret. Math., 2000

1999

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.

András Gyárfás, Zoltán Király, Jenö Lehel

SIAM J. Discret. Math., 1999

Loops With Partitions and Matchings.

Jenö Lehel, Inessa Levi

Ars Comb., 1999

Scenic graphs II: non-traceable graphs.

Michael S. Jacobson, André E. Kézdy, Jeno Lehel

Australas. J Comb., 1999

1998

Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete.

Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Networks, 1998

Tough enough chordal graphs are Hamiltonian.

Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Networks, 1998

Note on graphs without repeated cycle lengths.

Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve

J. Graph Theory, 1998

Scenic Graphs I: Traceable Graphs.

Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Ars Comb., 1998

1997

Recognizing Intersection Graphs of Linear Uniform Hypergraphs.

Michael S. Jacobson, André E. Kézdy, Jenö Lehel

Graphs Comb., 1997

The partition of a uniform hypergraph into pairs of dependent hyperedges.

Jenö Lehel

Discret. Math., 1997

On-line 3-chromatic graphs - II critical graphs.

András Gyárfás, Zoltán Király, Jenö Lehel

Discret. Math., 1997

1996

Minimal non-neighborhood-perfect graphs.

András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray

J. Graph Theory, 1996

Toughness, hamiltonicity and split graphs.

Dieter Kratsch, Jenö Lehel, Haiko Müller

Discret. Math., 1996

Graph spectra.

Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak

Discret. Math., 1996

Graphs with Largest Number of Minimum Cuts.

Jenö Lehel, Frédéric Maffray, Myriam Preissmann

Discret. Appl. Math., 1996

1995

Linear Sets with Five Distinct Differences among Any Four Elements.

András Gyárfás, Jenö Lehel

J. Comb. Theory, Ser. B, 1995

Irregular embeddings of multigraphs with fixed chromatic number.

Michael S. Jacobson, Jenö Lehel

Discret. Math., 1995

Irregular embeddings of hypergraphs with fixed chromatic number.

Michael S. Jacobson, Jenö Lehel

Discret. Math., 1995

1994

Neighbourhood-Perfect Line Graphs.

Jenö Lehel

Graphs Comb., 1994

On the rotation distance of graphs.

Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel

Discret. Math., 1994

1993

Ø-Threshold and Ø-Tolerance Chain Graphs.

Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak

Discret. Appl. Math., 1993

1992

Networks communicating for each pairing of terminals.

László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp

Networks, 1992

Three-regular path pairable graphs.

Ralph J. Faudree, András Gyárfás, Jenö Lehel

Graphs Comb., 1992

1991

The irregularity strength of tP₃.

Lael F. Kinch, Jenö Lehel

Discret. Math., 1991

Irregularity strength of dense graphs.

Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel

Discret. Math., 1991

Effective on-line coloring of P₅-free graphs.

András Gyárfás, Jenö Lehel

Comb., 1991

1989

The minimum number of triangles covering the edges of a graph.

Jenö Lehel

J. Graph Theory, 1989

M-chain graphs of posets.

Jenö Lehel, Fred R. McMorris, Debra D. Scott

Discret. Math., 1989

Irregular networks, regular graphs and integer matrices with distinct row and column sums.

Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel

Discret. Math., 1989

1988

On-line and first fit colorings of graphs.

András Gyárfás, Jenö Lehel

J. Graph Theory, 1988

Gallai-type Results for Multiple Boxes and Forests.

Jenö Lehel

Eur. J. Comb., 1988

Clumsy packing of dominoes.

András Gyárfás, Jenö Lehel, Zsolt Tuza

Discret. Math., 1988

1987

Local <i>k</i>-colorings of graphs and hypergraphs.

András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza

J. Comb. Theory, Ser. B, 1987

Ramsey numbers for local colorings.

András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza

Graphs Comb., 1987

Covering with Euclidean Boxes.

Imre Bárány, Jenö Lehel

Eur. J. Comb., 1987

1986

Neighborhood perfect graphs.

Jenö Lehel, Zsolt Tuza

Discret. Math., 1986

1985

A characterization of totally balanced hypergraphs.

Jenö Lehel

Discret. Math., 1985

Covering and coloring problems for relatives of intervals.

András Gyárfás, Jenö Lehel

Discret. Math., 1985

How many atoms can be defined by boxes.

András Gyárfás, Jenö Lehel, Zsolt Tuza

Comb., 1985

1984

The structure of rectangle families dividing the plane into maximum number of atoms.

András Gyárfás, Jenö Lehel, Zsolt Tuza

Discret. Math., 1984

1983

Hypergraph families with bounded edge cover or transversal number.

András Gyárfás, Jenö Lehel

Comb., 1983

1982

Triangle-free partial graphs and edge covering theorems.

Jenö Lehel, Zsolt Tuza

Discret. Math., 1982

Covers in hypergraphs.

Jenö Lehel

Comb., 1982

1981

Generating all 4-regular planar graphs from the graph of the octahedron.

Jenö Lehel

J. Graph Theory, 1981

1980

Ensembles d'articulation d'un graphe γ-critique.

Jenö Lehel, Zsolt Tuza

Discret. Math., 1980

Deltahedra are realizable as simplicial convex polyhedra.

Jenö Lehel

Discret. Appl. Math., 1980