Jenő Lehel

1.4k total citations
83 papers, 853 citations indexed

About

Jenő Lehel is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Jenő Lehel has authored 83 papers receiving a total of 853 indexed citations (citations by other indexed papers that have themselves been cited), including 64 papers in Computational Theory and Mathematics, 39 papers in Discrete Mathematics and Combinatorics and 31 papers in Geometry and Topology. Recurrent topics in Jenő Lehel's work include Advanced Graph Theory Research (58 papers), Limits and Structures in Graph Theory (35 papers) and graph theory and CDMA systems (21 papers). Jenő Lehel is often cited by papers focused on Advanced Graph Theory Research (58 papers), Limits and Structures in Graph Theory (35 papers) and graph theory and CDMA systems (21 papers). Jenő Lehel collaborates with scholars based in Hungary, United States and Japan. Jenő Lehel's co-authors include András Gyárfás, R. H. Schelp, Zs. Tuza, Paul Balister, Michael S. Jacobson, Ralph J. Faudree, Haiko Müller, Dieter Kratsch, Ervin Győri and Lael F. Kinch and has published in prestigious journals such as Networks, Discrete Applied Mathematics and Discrete Mathematics.

In The Last Decade

Jenő Lehel

78 papers receiving 792 citations

Peers

Jenő Lehel

CTM

DMC

GT

EEE

CNC

András Sebö France

Ignacio M. Pelayo Spain

Bjarne Toft Denmark

Hikoe Enomoto Japan

Charles Payan France

Yannis Manoussakis France

Geoffrey Exoo United States

Frédéric Maffray France

Herbert Fleischner Austria

R. E. L. Aldred New Zealand

András Sebö France

Jenő Lehel

593 ×0.8

CTM

119 ×0.3

DMC

161 ×0.6

GT

152 ×0.8

EEE

106 ×0.7

CNC

Citations per year, relative to Jenő Lehel Jenő Lehel (= 1×) peers András Sebö

Countries citing papers authored by Jenő Lehel

Since Specialization

Citations

This map shows the geographic impact of Jenő Lehel's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jenő Lehel with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jenő Lehel more than expected).

Fields of papers citing papers by Jenő Lehel

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Jenő Lehel. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jenő Lehel. The network helps show where Jenő Lehel may publish in the future.

Co-authorship network of co-authors of Jenő Lehel

This figure shows the co-authorship network connecting the top 25 collaborators of Jenő Lehel. A scholar is included among the top collaborators of Jenő Lehel based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jenő Lehel. Jenő Lehel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Barát, János, András Gyárfás, Jenő Lehel, & Gábor N. Sárközy. (2016). Ramsey number of paths and connected matchings in Ore-type host graphs. Discrete Mathematics. 339(6). 1690–1698.

2.

Lehel, Jenő, et al.. (2016). Detour trees. Discrete Applied Mathematics. 206. 73–80. 7 indexed citations

3.

Johnson, Peter D., et al.. (2010). List multicoloring problems involving the k-fold Hall numbers. Journal of Graph Theory. 65(1). 16–34.

4.

Gyárfás, András & Jenő Lehel. (2010). Trees in greedy colorings of hypergraphs. Discrete Mathematics. 311(2-3). 208–209. 2 indexed citations

5.

Gyárfás, András, Jenő Lehel, Gábor N. Sárközy, & R. H. Schelp. (2007). Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. Journal of Combinatorial Theory Series B. 98(2). 342–358. 24 indexed citations

6.

Lehel, Jenő, Frédéric Maffray, & Myriam Preissmann. (2007). Maximum directed cuts in digraphs with degree restriction. ArXiv.org. 1 indexed citations

7.

Kubicki, Grzegorz, Jenő Lehel, & Michał Morayne. (2006). Counting chains and antichains in the complete binary tree. Ars Combinatoria. 79. 2 indexed citations

8.

Gyárfás, András, et al.. (2006). Odd cycles and Θ-cycles in hypergraphs. Discrete Mathematics. 306(19-20). 2481–2491. 5 indexed citations

9.

Lehel, Jenő, et al.. (2002). A finite basis characterization of α-split colorings. Discrete Mathematics. 257(2-3). 415–421. 3 indexed citations

10.

Chen, Guantao, et al.. (2000). Clique covering the edges of a locally cobipartite graph. Discrete Mathematics. 219(1-3). 17–26. 5 indexed citations

11.

Jacobson, Michael S., et al.. (1999). Scenic graphs II: non-traceable graphs.. SZTAKI Publication Repository (Hungarian Academy of Sciences). 19. 287. 2 indexed citations

12.

Lehel, Jenő & Inessa Levi. (1999). Loops With Partitions and Matchings.. Ars Combinatoria. 54(21). 993–5. 6 indexed citations

13.

Jacobson, Michael S., et al.. (1998). Scenic Graphs I: Traceable Graphs.. Ars Combinatoria. 49. 3 indexed citations

14.

Kratsch, Dieter, Jenő Lehel, & Haiko Müller. (1996). Toughness, hamiltonicity and split graphs. Discrete Mathematics. 150(1-3). 231–245. 36 indexed citations

15.

Gyárfás, András & Jenő Lehel. (1995). Linear Sets with Five Distinct Differences among Any Four Elements. Journal of Combinatorial Theory Series B. 64(1). 108–118. 1 indexed citations

16.

Gyárfás, András, et al.. (1992). Minimal path-pairable graphs. SZTAKI Publication Repository (Hungarian Academy of Sciences). 7 indexed citations

17.

Gyárfás, András, et al.. (1992). Irregularity strength of uniform hypergraphs. SZTAKI Publication Repository (Hungarian Academy of Sciences). 4 indexed citations

18.

Gyárfás, András, Jenő Lehel, Jaroslav Nešetřil, et al.. (1987). Local k-colorings of graphs and hypergraphs. Journal of Combinatorial Theory Series B. 43(2). 127–139. 25 indexed citations

19.

Lehel, Jenő & Zs. Tuza. (1986). Neighborhood perfect graphs. Discrete Mathematics. 61(1). 93–101. 39 indexed citations

20.

Lehel, Jenő. (1985). A characterization of totally balanced hypergraphs. Discrete Mathematics. 57(1-2). 59–65. 15 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact