default search action
Jenö Lehel
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j91]André E. Kézdy, Jeno Lehel:
An asymptotic resolution of a conjecture of Szemerédi and Petruska. Discret. Math. 346(8): 113469 (2023) - [j90]Csaba Biró, Jeno Lehel, Géza Tóth:
Helly-Type Theorems for the Ordering of the Vertices of a Hypergraph. Order 40(3): 665-682 (2023) - 2022
- [i2]André E. Kézdy, Jeno Lehel:
An asymptotic resolution of a conjecture of Szemerédi and Petruska. CoRR abs/2208.11573 (2022) - 2021
- [j89]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Eckhoff's Problem on Convex Sets in the Plane. Electron. J. Comb. 28(3) (2021) - [j88]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Minimal 2-connected graphs satisfying the even cut condition. Inf. Process. Lett. 167: 106080 (2021) - [j87]András Gyárfás, Jeno Lehel:
Order plus size of 𝜏-critical graphs. J. Graph Theory 96(1): 85-86 (2021) - [j86]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Path-pairability of infinite planar grids. Period. Math. Hung. 83(2): 220-232 (2021) - 2020
- [j85]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Note on the bisection width of cubic graphs. Discret. Appl. Math. 285: 434-442 (2020) - [j84]Adam S. Jobson, André E. Kézdy, Jeno Lehel, Timothy J. Pervenecki, Géza Tóth:
Petruska's question on planar convex sets. Discret. Math. 343(9): 111956 (2020)
2010 – 2019
- 2019
- [j83]Adam S. Jobson, André E. Kézdy, Jeno Lehel, Gábor Mészáros:
The path-pairability number of products of stars. Discuss. Math. Graph Theory 39(4): 909-924 (2019) - 2018
- [j82]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
The minimum size of graphs satisfying cut conditions. Discret. Appl. Math. 237: 89-96 (2018) - [j81]Hui Du, Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto:
A panconnectivity theorem for bipartite graphs. Discret. Math. 341(1): 151-154 (2018) - [j80]Adam S. Jobson, André E. Kézdy, Jeno Lehel:
Linkage on the infinite grid. Inf. Process. Lett. 137: 51-56 (2018) - 2016
- [j79]András Gyárfás, Jeno Lehel:
Red-Blue Clique Partitions and (1-1)-Transversals. Electron. J. Comb. 23(3): 3 (2016) - [j78]Adam S. Jobson, André E. Kézdy, Jenö Lehel, Susan C. White:
Detour trees. Discret. Appl. Math. 206: 73-80 (2016) - [j77]János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy:
Ramsey number of paths and connected matchings in Ore-type host graphs. Discret. Math. 339(6): 1690-1698 (2016) - [j76]Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto:
Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. Graphs Comb. 32(3): 963-986 (2016) - [j75]Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto:
Vertex Coloring of Graphs by Total 2-Weightings. Graphs Comb. 32(6): 2461-2471 (2016) - [j74]Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Random Hypergraph Irregularity. SIAM J. Discret. Math. 30(1): 465-473 (2016) - 2014
- [j73]Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto:
Note on Locating Pairs of Vertices on Hamiltonian Cycles. Graphs Comb. 30(4): 887-894 (2014) - 2013
- [j72]Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne:
Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. 27(1): 145-154 (2013) - 2011
- [j71]András Gyárfás, Jenö Lehel:
Trees in greedy colorings of hypergraphs. Discret. Math. 311(2-3): 208-209 (2011) - 2010
- [j70]Zoltán Füredi, Jenö Lehel:
Tight embeddings of partial quadrilateral packings. J. Comb. Theory A 117(4): 466-474 (2010) - [j69]Mathew Cropper, Anthony J. W. Hilton, Peter D. Johnson Jr., Jenö Lehel:
List multicoloring problems involving the k-fold Hall numbers. J. Graph Theory 65(1): 16-34 (2010)
2000 – 2009
- 2009
- [j68]Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Maximum directed cuts in digraphs with degree restriction. J. Graph Theory 61(2): 140-156 (2009) - 2008
- [j67]Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Connected graphs without long paths. Discret. Math. 308(19): 4487-4494 (2008) - [j66]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 B 98(2): 342-358 (2008) - 2007
- [j65]András Gyárfás, Jenö Lehel, Richard H. Schelp:
Finding a monochromatic subgraph or a rainbow path. J. Graph Theory 54(1): 1-12 (2007) - [j64]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): 1-13 (2007) - [j63]Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. 21(1): 237-250 (2007) - [i1]Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Maximum directed cuts in digraphs with degree restriction. CoRR abs/0711.3958 (2007) - 2006
- [j62]Grzegorz Kubicki, Jeno Lehel, Michal Morayne:
Counting chains and antichains in the complete binary tree. Ars Comb. 79 (2006) - [j61]Mathew Cropper, András Gyárfás, Jenö Lehel:
Hall ratio of the Mycielski graphs. Discret. Math. 306(16): 1988-1990 (2006) - [j60]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): 2481-2491 (2006) - [j59]Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp:
Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory A 113(1): 101-112 (2006) - [j58]Paul N. Balister, Jenö Lehel, Richard H. Schelp:
Ramsey unsaturated and saturated graphs. J. Graph Theory 51(1): 22-32 (2006) - 2004
- [j57]Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp:
Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. 13(3): 311-317 (2004) - [j56]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): 462-471 (2004) - 2003
- [j55]André E. Kézdy, Jenö Lehel, Robert C. Powers:
Heavy Transversals and Indecomposable Hypergraphs. Comb. 23(2): 303-310 (2003) - [j54]Mathew Cropper, András Gyárfás, Jenö Lehel:
Edge list multicoloring trees: An extension of Hall's theorem. J. Graph Theory 42(3): 246-255 (2003) - [j53]Grzegorz Kubicki, Jenö Lehel, Michal Morayne:
An Asymptotic Ratio in the Complete Binary Tree. Order 20(2): 91-97 (2003) - 2002
- [j52]Grzegorz Kubicki, Jenö Lehel, Michal Morayne:
A Ratio Inequality For Binary Trees And The Best Secretary. Comb. Probab. Comput. 11(2): 149-161 (2002) - [j51]Grzegorz Kubicki, Jenö Lehel:
Foreword. Discret. Math. 249(1-3): 1- (2002) - [j50]András Gyárfás, André E. Kézdy, Jenö Lehel:
A finite basis characterization of ?-split colorings. Discret. Math. 257(2-3): 415-421 (2002) - [j49]Grzegorz Kubicki, Jenö Lehel, Michal Morayne:
Patch Colorings and Rigid Colorings of the Rational n-Space. J. Comb. Theory B 84(1): 45-53 (2002) - 2001
- [j48]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): 135-141 (2001) - 2000
- [j47]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): 17-26 (2000) - [j46]Ralph J. Faudree, Evelyne Flandrin, Michael S. Jacobson, Jeno Lehel, Richard H. Schelp:
Even Cycles in Graphs with Many Odd Cycles. Graphs Comb. 16(4): 399-410 (2000)
1990 – 1999
- 1999
- [j45]Michael S. Jacobson, André E. Kézdy, Jeno Lehel:
Scenic graphs II: non-traceable graphs. Australas. J Comb. 19: 287- (1999) - [j44]Jenö Lehel, Inessa Levi:
Loops With Partitions and Matchings. Ars Comb. 54 (1999) - [j43]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): 385-411 (1999) - 1998
- [j42]Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Scenic Graphs I: Traceable Graphs. Ars Comb. 49 (1998) - [j41]Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve:
Note on graphs without repeated cycle lengths. J. Graph Theory 29(1): 11-15 (1998) - [j40]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): 1-10 (1998) - [j39]Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Tough enough chordal graphs are Hamiltonian. Networks 31(1): 29-38 (1998) - 1997
- [j38]Jenö Lehel:
The partition of a uniform hypergraph into pairs of dependent hyperedges. Discret. Math. 163(1-3): 313-318 (1997) - [j37]András Gyárfás, Zoltán Király, Jenö Lehel:
On-line 3-chromatic graphs - II critical graphs. Discret. Math. 177(1-3): 99-122 (1997) - [j36]Michael S. Jacobson, André E. Kézdy, Jenö Lehel:
Recognizing Intersection Graphs of Linear Uniform Hypergraphs. Graphs Comb. 13(4): 359-367 (1997) - 1996
- [j35]Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Graphs with Largest Number of Minimum Cuts. Discret. Appl. Math. 65(1-3): 387-407 (1996) - [j34]Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
Graph spectra. Discret. Math. 150(1-3): 103-113 (1996) - [j33]Dieter Kratsch, Jenö Lehel, Haiko Müller:
Toughness, hamiltonicity and split graphs. Discret. Math. 150(1-3): 231-245 (1996) - [j32]András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray:
Minimal non-neighborhood-perfect graphs. J. Graph Theory 21(1): 55-66 (1996) - 1995
- [j31]Michael S. Jacobson, Jenö Lehel:
Irregular embeddings of hypergraphs with fixed chromatic number. Discret. Math. 145(1-3): 145-150 (1995) - [j30]Michael S. Jacobson, Jenö Lehel:
Irregular embeddings of multigraphs with fixed chromatic number. Discret. Math. 145(1-3): 295-299 (1995) - [j29]András Gyárfás, Jenö Lehel:
Linear Sets with Five Distinct Differences among Any Four Elements. J. Comb. Theory B 64(1): 108-118 (1995) - 1994
- [j28]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): 121-135 (1994) - [j27]Jenö Lehel:
Neighbourhood-Perfect Line Graphs. Graphs Comb. 10(2-4): 353-361 (1994) - 1993
- [j26]Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak:
Ø-Threshold and Ø-Tolerance Chain Graphs. Discret. Appl. Math. 44(1-3): 191-203 (1993) - 1992
- [j25]Ralph J. Faudree, András Gyárfás, Jenö Lehel:
Three-regular path pairable graphs. Graphs Comb. 8(1): 45-52 (1992) - [j24]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): 615-626 (1992) - 1991
- [j23]András Gyárfás, Jenö Lehel:
Effective on-line coloring of P5-free graphs. Comb. 11(2): 181-184 (1991) - [j22]Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel:
Irregularity strength of dense graphs. Discret. Math. 91(1): 45-59 (1991) - [j21]Lael F. Kinch, Jenö Lehel:
The irregularity strength of tP3. Discret. Math. 94(1): 75-79 (1991)
1980 – 1989
- 1989
- [j20]Jenö Lehel, Fred R. McMorris, Debra D. Scott:
M-chain graphs of posets. Discret. Math. 74(3): 341-346 (1989) - [j19]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): 223-240 (1989) - [j18]Jenö Lehel:
The minimum number of triangles covering the edges of a graph. J. Graph Theory 13(3): 369-384 (1989) - 1988
- [j17]András Gyárfás, Jenö Lehel, Zsolt Tuza:
Clumsy packing of dominoes. Discret. Math. 71(1): 33-46 (1988) - [j16]Jenö Lehel:
Gallai-type Results for Multiple Boxes and Forests. Eur. J. Comb. 9(2): 113-120 (1988) - [j15]András Gyárfás, Jenö Lehel:
On-line and first fit colorings of graphs. J. Graph Theory 12(2): 217-227 (1988) - 1987
- [j14]Imre Bárány, Jenö Lehel:
Covering with Euclidean Boxes. Eur. J. Comb. 8(2): 113-119 (1987) - [j13]András Gyárfás, Jeno Lehel, Richard H. Schelp, Zsolt Tuza:
Ramsey numbers for local colorings. Graphs Comb. 3(1): 267-277 (1987) - [j12]András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza:
Local k-colorings of graphs and hypergraphs. J. Comb. Theory B 43(2): 127-139 (1987) - 1986
- [j11]Jenö Lehel, Zsolt Tuza:
Neighborhood perfect graphs. Discret. Math. 61(1): 93-101 (1986) - 1985
- [j10]András Gyárfás, Jenö Lehel, Zsolt Tuza:
How many atoms can be defined by boxes. Comb. 5(3): 193-204 (1985) - [j9]András Gyárfás, Jenö Lehel:
Covering and coloring problems for relatives of intervals. Discret. Math. 55(2): 167-180 (1985) - [j8]Jenö Lehel:
A characterization of totally balanced hypergraphs. Discret. Math. 57(1-2): 59-65 (1985) - 1984
- [j7]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): 177-198 (1984) - 1983
- [j6]András Gyárfás, Jenö Lehel:
Hypergraph families with bounded edge cover or transversal number. Comb. 3(3): 351-358 (1983) - 1982
- [j5]Jenö Lehel:
Covers in hypergraphs. Comb. 2(3): 305-309 (1982) - [j4]Jenö Lehel, Zsolt Tuza:
Triangle-free partial graphs and edge covering theorems. Discret. Math. 39(1): 59-65 (1982) - 1981
- [j3]Jenö Lehel:
Generating all 4-regular planar graphs from the graph of the octahedron. J. Graph Theory 5(4): 423-426 (1981) - 1980
- [j2]Jenö Lehel:
Deltahedra are realizable as simplicial convex polyhedra. Discret. Appl. Math. 2(1): 81-84 (1980) - [j1]Jenö Lehel, Zsolt Tuza:
Ensembles d'articulation d'un graphe γ-critique. Discret. Math. 30(3): 245-248 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint