Jeno Lehel

25 papers Journal 25
YearRankTypeTitle / Venue / Authors
2026 J jnl
The Schrijver system of the length polyhedron of an interval order.
Discret. Appl. Math.
André E. Kézdy, Jeno Lehel
2026 J jnl
The length polyhedron of an interval order.
Discret. Optim.
Csaba Biró, André E. Kézdy, Jeno Lehel
2026 J jnl
Two-count Interval Representation of a Permutation.
Order
Csaba Biró, André E. Kézdy, Jeno Lehel
2024 J jnl
The Schrijver system of the length polyhedron of an interval order.
CoRR
André E. Kézdy, Jeno Lehel
2023 J jnl
An asymptotic resolution of a conjecture of Szemerédi and Petruska.
Discret. Math.
André E. Kézdy, Jeno Lehel
2023 J jnl
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph.
Order
Csaba Biró, Jeno Lehel, Géza Tóth
2022 J jnl
An asymptotic resolution of a conjecture of Szemerédi and Petruska.
CoRR
André E. Kézdy, Jeno Lehel
2021 J jnl
Eckhoff's Problem on Convex Sets in the Plane.
Electron. J. Comb.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2021 J jnl
Minimal 2-connected graphs satisfying the even cut condition.
Inf. Process. Lett.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2021 J jnl
Order plus size of 𝜏-critical graphs.
J. Graph Theory
András Gyárfás, Jeno Lehel
2021 J jnl
Path-pairability of infinite planar grids.
Period. Math. Hung.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2020 J jnl
Note on the bisection width of cubic graphs.
Discret. Appl. Math.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2020 J jnl
Petruska's question on planar convex sets.
Discret. Math.
Adam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth
2019 J jnl
The path-pairability number of products of stars.
Discuss. Math. Graph Theory
Adam S. Jobson, André E. Kézdy, Jeno Lehel, Gábor Mészáros
2018 J jnl
A panconnectivity theorem for bipartite graphs.
Discret. Math.
Hui Du, Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto
2018 J jnl
Linkage on the infinite grid.
Inf. Process. Lett.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2018 J jnl
The minimum size of graphs satisfying cut conditions.
Discret. Appl. Math.
Adam S. Jobson, André E. Kézdy, Jeno Lehel
2016 J jnl
Ramsey number of paths and connected matchings in Ore-type host graphs.
Discret. Math.
János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy
2016 J jnl
Red-Blue Clique Partitions and (1-1)-Transversals.
Electron. J. Comb.
András Gyárfás, Jeno Lehel
2016 J jnl
Vertex Coloring of Graphs by Total 2-Weightings.
Graphs Comb.
Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto
2014 J jnl
Note on Locating Pairs of Vertices on Hamiltonian Cycles.
Graphs Comb.
Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto
2006 J jnl
Counting chains and antichains in the complete binary tree.
Ars Comb.
Grzegorz Kubicki, Jeno Lehel, Michal Morayne
2000 J jnl
Even Cycles in Graphs with Many Odd Cycles.
Graphs Comb.
Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp
1999 J jnl
Scenic graphs II: non-traceable graphs.
Australas. J Comb.
Michael S. Jacobson, André E. Kézdy, Jeno Lehel
1987 J jnl
Ramsey numbers for local colorings.
Graphs Comb.
András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza