Pavol Hell
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.05%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 173
- Graph Labeling and Dimension Problems 67
- Complexity and Algorithms in Graphs 49
- semigroups and automata theory 14
-
- Limits and Structures in Graph Theory 55
- Co-authors
- Jaroslav Nešetřil (18 shared papers)Ronald Graham (1 shared paper)Tomás Feder (36 shared papers)David Kirkpatrick (11 shared papers)Jing Huang (20 shared papers)Xuding Zhu (10 shared papers)Sulamita Klein (9 shared papers)Jørgen Bang‐Jensen (6 shared papers)
- Journals
- Discrete Mathematics (31 papers)Discrete Applied Mathematics (26 papers)SIAM Journal on Discrete Mathematics (19 papers)European Journal of Combinatorics (11 papers)Journal of Graph Theory (9 papers)
- Partner nations
- CanadaUnited StatesCzechia
In The Last Decade
Pavol Hell
198 papers receiving 4.9k citations
Pavol Hell's Hit Papers
Peers
Comparison fields: 5 of 128
- Discrete Mathematics and Combinatorics 1.5k
- Computational Theory and Mathematics 4.3k
- Geometry and Topology 790
- Computer Graphics and Computer-Aided Design 271
- Computer Networks and Communications 1.5k
Countries citing papers authored by Pavol Hell
This map shows the geographic impact of Pavol Hell'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 Pavol Hell with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pavol Hell more than expected).
Fields of papers citing papers by Pavol Hell
This network shows the impact of papers produced by Pavol Hell. 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 Pavol Hell. The network helps show where Pavol Hell may publish in the future.
Co-authors
The 25 scholars most cited alongside Pavol Hell, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 211 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | On the History of the Minimum Spanning Tree Problem Hit paper breakdown → | 1985 | 549 |
| 2 | Graphs and Homomorphisms Hit paper breakdown → | 2004 | 496 |
| 3 | On the complexity of H-coloring Hit paper breakdown → | 1990 | 459 |
| 4 | 1992 | 152 | |
| 5 | 1983 | 144 | |
| 6 | 1996 | 131 | |
| 7 | 1999 | 121 | |
| 8 | 1978 | 119 | |
| 9 | 1990 | 108 | |
| 10 | 2003 | 104 | |
| 11 | 1998 | 99 | |
| 12 | 1999 | 85 | |
| 13 | 1996 | 79 | |
| 14 | 1988 | 69 | |
| 15 | 2002 | 67 | |
| 16 | 2004 | 59 | |
| 17 | 1972 | 58 | |
| 18 | 1988 | 57 | |
| 19 | 2008 | 56 | |
| 20 | 1990 | 52 |
About Pavol Hell
Pavol Hell is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Computer Networks and Communications and Geometry and Topology, having authored 211 papers that have together received 5.4k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (173 papers), Graph Labeling and Dimension Problems (67 papers), Limits and Structures in Graph Theory (55 papers), Complexity and Algorithms in Graphs (49 papers), graph theory and CDMA systems (45 papers), Interconnection Networks and Systems (22 papers), Graph theory and applications (21 papers) and semigroups and automata theory (14 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.5k citations), Computational Theory and Mathematics (4.3k citations), Geometry and Topology (790 citations), Computer Graphics and Computer-Aided Design (271 citations) and Computer Networks and Communications (1.5k citations). Pavol Hell has collaborated with scholars based in Canada, United States and Czechia. Frequent co-authors include Jaroslav Nešetřil, Ronald Graham, Tomás Feder, David Kirkpatrick, Jing Huang, Xuding Zhu, Sulamita Klein, Jørgen Bang‐Jensen, Roland Häggkvist and J. A. Bondy. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, SIAM Journal on Discrete Mathematics, European Journal of Combinatorics and Journal of Graph Theory.
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.