Jenö Lehel

Orcid: 0000-0003-4249-1082

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

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of one.



In proceedings 
PhD thesis 


Online presence:



Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph.
Order, October, 2023

An asymptotic resolution of a conjecture of Szemerédi and Petruska.
Discret. Math., August, 2023

Path-pairability of infinite planar grids.
Period. Math. Hung., 2021

Order plus size of 𝜏-critical graphs.
J. Graph Theory, 2021

Minimal 2-connected graphs satisfying the even cut condition.
Inf. Process. Lett., 2021

Eckhoff's Problem on Convex Sets in the Plane.
Electron. J. Comb., 2021

Petruska's question on planar convex sets.
Discret. Math., 2020

Note on the bisection width of cubic graphs.
Discret. Appl. Math., 2020

The path-pairability number of products of stars.
Discuss. Math. Graph Theory, 2019

Linkage on the infinite grid.
Inf. Process. Lett., 2018

A panconnectivity theorem for bipartite graphs.
Discret. Math., 2018

The minimum size of graphs satisfying cut conditions.
Discret. Appl. Math., 2018

Random Hypergraph Irregularity.
SIAM J. Discret. Math., 2016

Vertex Coloring of Graphs by Total 2-Weightings.
Graphs Comb., 2016

Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs.
Graphs Comb., 2016

Ramsey number of paths and connected matchings in Ore-type host graphs.
Discret. Math., 2016

Detour trees.
Discret. Appl. Math., 2016

Red-Blue Clique Partitions and (1-1)-Transversals.
Electron. J. Comb., 2016

Note on Locating Pairs of Vertices on Hamiltonian Cycles.
Graphs Comb., 2014

Repeated Degrees in Random Uniform Hypergraphs.
SIAM J. Discret. Math., 2013

Trees in greedy colorings of hypergraphs.
Discret. Math., 2011

List multicoloring problems involving the <i>k</i>-fold Hall numbers.
J. Graph Theory, 2010

Tight embeddings of partial quadrilateral packings.
J. Comb. Theory A, 2010

Maximum directed cuts in digraphs with degree restriction.
J. Graph Theory, 2009

Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.
J. Comb. Theory B, 2008

Connected graphs without long paths.
Discret. Math., 2008

Adjacent Vertex Distinguishing Edge-Colorings.
SIAM J. Discret. Math., 2007

Finding a monochromatic subgraph or a rainbow path.
J. Graph Theory, 2007

Maximum directed cuts in acyclic digraphs.
J. Graph Theory, 2007

Ramsey unsaturated and saturated graphs.
J. Graph Theory, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.
J. Comb. Theory A, 2006

Odd cycles and Theta-cycles in hypergraphs.
Discret. Math., 2006

Hall ratio of the Mycielski graphs.
Discret. Math., 2006

Counting chains and antichains in the complete binary tree.
Ars Comb., 2006

The Bar Visibility Number of a Graph.
SIAM J. Discret. Math., 2004

Longest Paths in Circular Arc Graphs.
Comb. Probab. Comput., 2004

An Asymptotic Ratio in the Complete Binary Tree.
Order, 2003

Edge list multicoloring trees: An extension of Hall's theorem.
J. Graph Theory, 2003

Heavy Transversals and Indecomposable Hypergraphs.
Comb., 2003

Patch Colorings and Rigid Colorings of the Rational n-Space.
J. Comb. Theory B, 2002

Discret. Math., 2002

A finite basis characterization of ?-split colorings.
Discret. Math., 2002

A Ratio Inequality For Binary Trees And The Best Secretary.
Comb. Probab. Comput., 2002

Edge disjoint monochromatic triangles in 2-colored graphs.
Discret. Math., 2001

Even Cycles in Graphs with Many Odd Cycles.
Graphs Comb., 2000

Clique covering the edges of a locally cobipartite graph.
Discret. Math., 2000

On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.
SIAM J. Discret. Math., 1999

Loops With Partitions and Matchings.
Ars Comb., 1999

Scenic graphs II: non-traceable graphs.
Australas. J Comb., 1999

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

Tough enough chordal graphs are Hamiltonian.
Networks, 1998

Note on graphs without repeated cycle lengths.
J. Graph Theory, 1998

Scenic Graphs I: Traceable Graphs.
Ars Comb., 1998

Recognizing Intersection Graphs of Linear Uniform Hypergraphs.
Graphs Comb., 1997

The partition of a uniform hypergraph into pairs of dependent hyperedges.
Discret. Math., 1997

On-line 3-chromatic graphs - II critical graphs.
Discret. Math., 1997

Minimal non-neighborhood-perfect graphs.
J. Graph Theory, 1996

Toughness, hamiltonicity and split graphs.
Discret. Math., 1996

Graph spectra.
Discret. Math., 1996

Graphs with Largest Number of Minimum Cuts.
Discret. Appl. Math., 1996

Linear Sets with Five Distinct Differences among Any Four Elements.
J. Comb. Theory B, 1995

Irregular embeddings of multigraphs with fixed chromatic number.
Discret. Math., 1995

Irregular embeddings of hypergraphs with fixed chromatic number.
Discret. Math., 1995

Neighbourhood-Perfect Line Graphs.
Graphs Comb., 1994

On the rotation distance of graphs.
Discret. Math., 1994

Ø-Threshold and Ø-Tolerance Chain Graphs.
Discret. Appl. Math., 1993

Networks communicating for each pairing of terminals.
Networks, 1992

Three-regular path pairable graphs.
Graphs Comb., 1992

The irregularity strength of tP<sub>3</sub>.
Discret. Math., 1991

Irregularity strength of dense graphs.
Discret. Math., 1991

Effective on-line coloring of P<sub>5</sub>-free graphs.
Comb., 1991

The minimum number of triangles covering the edges of a graph.
J. Graph Theory, 1989

M-chain graphs of posets.
Discret. Math., 1989

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

On-line and first fit colorings of graphs.
J. Graph Theory, 1988

Gallai-type Results for Multiple Boxes and Forests.
Eur. J. Comb., 1988

Clumsy packing of dominoes.
Discret. Math., 1988

Local <i>k</i>-colorings of graphs and hypergraphs.
J. Comb. Theory B, 1987

Ramsey numbers for local colorings.
Graphs Comb., 1987

Covering with Euclidean Boxes.
Eur. J. Comb., 1987

Neighborhood perfect graphs.
Discret. Math., 1986

A characterization of totally balanced hypergraphs.
Discret. Math., 1985

Covering and coloring problems for relatives of intervals.
Discret. Math., 1985

How many atoms can be defined by boxes.
Comb., 1985

The structure of rectangle families dividing the plane into maximum number of atoms.
Discret. Math., 1984

Hypergraph families with bounded edge cover or transversal number.
Comb., 1983

Triangle-free partial graphs and edge covering theorems.
Discret. Math., 1982

Covers in hypergraphs.
Comb., 1982

Generating all 4-regular planar graphs from the graph of the octahedron.
J. Graph Theory, 1981

Ensembles d'articulation d'un graphe γ-critique.
Discret. Math., 1980

Deltahedra are realizable as simplicial convex polyhedra.
Discret. Appl. Math., 1980