John Talbot
Impact in
-
- Limits and Structures in Graph Theory
- Geometry and Topology top 5%
- Graph theory and applications
Papers in ⓘ
-
- Advanced Graph Theory Research 17
- Graph Labeling and Dimension Problems 7
-
- Limits and Structures in Graph Theory 18
- Co-authors
- Dominic Welsh (1 shared paper)Eric Frappa (4 shared papers)D. Herald (5 shared papers)David Dunham (4 shared papers)Josef Ďurech (2 shared papers)J. Hanuš (2 shared papers)M. Kaasalainen (2 shared papers)J. Robert Johnson (3 shared papers)
- Journals
- Discrete Mathematics (3 papers)Combinatorics Probability Computing (3 papers)SIAM Journal on Discrete Mathematics (2 papers)The Electronic Journal of Combinatorics (2 papers)Journal of Combinatorial Theory Series A (2 papers)
- Partner nations
- United KingdomUnited StatesAustralia
In The Last Decade
John Talbot
28 papers receiving 440 citations
Peers
Comparison fields: 5 of 46
- Discrete Mathematics and Combinatorics 240
- Geometry and Topology 136
- Computational Theory and Mathematics 216
- Computational Mathematics 7
- Astronomy and Astrophysics 137
Countries citing papers authored by John Talbot
This map shows the geographic impact of John Talbot'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 John Talbot with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Talbot more than expected).
Fields of papers citing papers by John Talbot
This network shows the impact of papers produced by John Talbot. 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 John Talbot. The network helps show where John Talbot may publish in the future.
Co-authors
The 25 scholars most cited alongside John Talbot, 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 31 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2011 | 69 | |
| 2 | 2017 | 52 | |
| 3 | 2010 | 46 | |
| 4 | 2006 | 44 | |
| 5 | 2002 | 41 | |
| 6 | 2005 | 27 | |
| 7 | 2006 | 27 | |
| 8 | 2006 | 25 | |
| 9 | 2005 | 23 | |
| 10 | 2003 | 23 | |
| 11 | 2020 | 20 | |
| 12 | 2012 | 19 | |
| 13 | 2009 | 11 | |
| 14 | 2014 | 9 | |
| 15 | 2010 | 6 | |
| 16 | 2007 | 5 | |
| 17 | 2004 | 4 | |
| 18 | Bloom maps | 2008 | 3 |
| 19 | 2004 | 3 | |
| 20 | 2008 | 3 |
About John Talbot
John Talbot is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Astronomy and Astrophysics and Electrical and Electronic Engineering, having authored 31 papers that have together received 473 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (18 papers), Advanced Graph Theory Research (17 papers), Graph Labeling and Dimension Problems (7 papers), Graph theory and applications (7 papers), Planetary Science and Exploration (4 papers), Astro and Planetary Science (4 papers), Stellar, planetary, and galactic studies (3 papers) and graph theory and CDMA systems (3 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (240 citations), Geometry and Topology (136 citations), Computational Theory and Mathematics (216 citations), Computational Mathematics (7 citations) and Astronomy and Astrophysics (137 citations). John Talbot has collaborated with scholars based in United Kingdom, United States and Australia. Frequent co-authors include Dominic Welsh, Dominic Welsh, Eric Frappa, D. Herald, David Dunham, Josef Ďurech, J. Hanuš, M. Kaasalainen, J. Robert Johnson and Vojtěch Rödl. Their work appears in journals such as Discrete Mathematics, Combinatorics Probability Computing, SIAM Journal on Discrete Mathematics, The Electronic Journal of Combinatorics and Journal of Combinatorial Theory Series A.
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.