Jeno Lehel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 19 from 19

2023

Helly-Type Theorems for the Ordering of the Vertices of a HypergraphCsaba Biró, Jeno Lehel, Géza Tóth 0001. order, 40(3):665-682, October 2023. [doi]

An asymptotic resolution of a conjecture of Szemerédi and PetruskaAndré E. Kézdy, Jeno Lehel. DM, 346(8):113469, August 2023. [doi]

2021

Minimal 2-connected graphs satisfying the even cut conditionAdam S. Jobson, André E. Kézdy, Jeno Lehel. ipl, 167:106080, 2021. [doi]

Eckhoff's Problem on Convex Sets in the PlaneAdam S. Jobson, André E. Kézdy, Jeno Lehel. combinatorics, 28(3), 2021. [doi]

Path-pairability of infinite planar gridsAdam S. Jobson, André E. Kézdy, Jeno Lehel. pmh, 83(2):220-232, 2021. [doi]

2020

Note on the bisection width of cubic graphsAdam S. Jobson, André E. Kézdy, Jeno Lehel. DAM, 285:434-442, 2020. [doi]

Petruska's question on planar convex setsAdam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth 0001. DM, 343(9):111956, 2020. [doi]

2019

The path-pairability number of products of starsAdam S. Jobson, André E. Kézdy, Jeno Lehel, Gábor Mészáros. dmgt, 39(4):909-924, 2019. [doi]

2018

A panconnectivity theorem for bipartite graphsHui Du, Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto. DM, 341(1):151-154, 2018. [doi]

The minimum size of graphs satisfying cut conditionsAdam S. Jobson, André E. Kézdy, Jeno Lehel. DAM, 237:89-96, 2018. [doi]

Linkage on the infinite gridAdam S. Jobson, André E. Kézdy, Jeno Lehel. ipl, 137:51-56, 2018. [doi]

2016

Ramsey number of paths and connected matchings in Ore-type host graphsJános Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy. DM, 339(6):1690-1698, 2016. [doi]

Red-Blue Clique Partitions and (1-1)-TransversalsAndrás Gyárfás, Jeno Lehel. combinatorics, 23(3):3, 2016. [doi]

Vertex Coloring of Graphs by Total 2-WeightingsJonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto. gc, 32(6):2461-2471, 2016. [doi]

2014

Note on Locating Pairs of Vertices on Hamiltonian CyclesRalph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto. gc, 30(4):887-894, 2014. [doi]

2006

Counting chains and antichains in the complete binary treeGrzegorz Kubicki, Jeno Lehel, Michal Morayne. arscom, 79, 2006.

2000

Even Cycles in Graphs with Many Odd CyclesRalph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp. gc, 16(4):399-410, 2000. [doi]

1999

Scenic graphs II: non-traceable graphsMichael S. Jacobson, André E. Kézdy, Jeno Lehel. ajc, 19:287, 1999. [doi]

1987

Ramsey numbers for local coloringsAndrás Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza. gc, 3(1):267-277, 1987. [doi]

Sign in or sign up to see more results.

runs on WebDSL