Jenő Lehel
- Computational Theory and Mathematics top 0.5%
- Discrete Mathematics and Combinatorics top 1%
- Geometry and Topology top 2%
- Electrical and Electronic Engineering
- Computer Networks and Communications top 10%
- Co-authors
- András GyárfásR. H. SchelpZs. TuzaPaul BalisterMichael S. JacobsonRalph J. FaudreeHaiko MüllerDieter Kratsch
- Topics
- Advanced Graph Theory Research (58 papers)Limits and Structures in Graph Theory (35 papers)graph theory and CDMA systems (21 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsGeometry and Topology
- Partner nations
- HungaryUnited StatesJapan
In The Last Decade
Jenő Lehel
78 papers receiving 792 citations
Peers
Comparison fields: 5 of 42
- Computational Theory and Mathematics 746
- Discrete Mathematics and Combinatorics 361
- Geometry and Topology 276
- Electrical and Electronic Engineering 180
- Computer Networks and Communications 163
Countries citing papers authored by Jenő Lehel
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 7 | |
| 3 | List multicoloring problems involving the k-fold Hall numbers | 0 |
| 4 | 2 | |
| 5 | 24 | |
| 6 | Maximum directed cuts in digraphs with degree restriction | 1 |
| 7 | Counting chains and antichains in the complete binary tree | 2 |
| 8 | 5 | |
| 9 | 3 | |
| 10 | 5 | |
| 11 | Scenic graphs II: non-traceable graphs. | 2 |
| 12 | Loops With Partitions and Matchings. | 6 |
| 13 | Scenic Graphs I: Traceable Graphs. | 3 |
| 14 | 36 | |
| 15 | 1 | |
| 16 | Minimal path-pairable graphs | 7 |
| 17 | Irregularity strength of uniform hypergraphs | 4 |
| 18 | 25 | |
| 19 | 39 | |
| 20 | 15 |
About Jenő Lehel
Jenő Lehel is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 83 papers that have together received 853 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (58 papers), Limits and Structures in Graph Theory (35 papers) and graph theory and CDMA systems (21 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (361 citations), Computational Theory and Mathematics (746 citations) and Geometry and Topology (276 citations). Jenő Lehel has collaborated with scholars based in Hungary, United States and Japan. Frequent 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. Their work appears in journals such as Networks, Discrete Applied Mathematics and Discrete Mathematics.
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.