Neil J. Calkin
- Computational Theory and Mathematics top 2%
- Discrete Mathematics and Combinatorics top 2%
- Artificial Intelligence top 10%
- Geometry and Topology top 5%
- Algebra and Number Theory top 10%
- Co-authors
- Herbert S. WilfPeter DankelmannJ. D. KeyMarcos López de PradoAlan FriezeCriel MerinoMarc NoySteven D. Noble
- Topics
- Limits and Structures in Graph Theory (15 papers)Advanced Graph Theory Research (8 papers)Mathematical Dynamics and Fractals (8 papers)
- Cited by
- Discrete Mathematics and CombinatoricsAlgebra and Number TheoryComputational Theory and Mathematics
- Journals
- Mathematics of ComputationAmerican Mathematical MonthlyJournal of Computational and Applied Mathematics
- Partner nations
- United StatesCanadaHungary
In The Last Decade
Neil J. Calkin
45 papers receiving 442 citations
Peers
Comparison fields: 5 of 59
- Computational Theory and Mathematics 240
- Discrete Mathematics and Combinatorics 177
- Artificial Intelligence 137
- Geometry and Topology 121
- Algebra and Number Theory 99
Countries citing papers authored by Neil J. Calkin
This map shows the geographic impact of Neil J. Calkin'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 Neil J. Calkin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Neil J. Calkin more than expected).
Fields of papers citing papers by Neil J. Calkin
This network shows the impact of papers produced by Neil J. Calkin. 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 Neil J. Calkin. The network helps show where Neil J. Calkin may publish in the future.
Co-authorship network of co-authors of Neil J. Calkin
This figure shows the co-authorship network connecting the top 25 collaborators of Neil J. Calkin. A scholar is included among the top collaborators of Neil J. Calkin 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 Neil J. Calkin. Neil J. Calkin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 2 | |
| 3 | 6 | |
| 4 | 0 | |
| 5 | 10 | |
| 6 | 7 | |
| 7 | 12 | |
| 8 | The Domatic Number of Regular Graphs. | 13 |
| 9 | 1 | |
| 10 | 2 | |
| 11 | 18 | |
| 12 | 7 | |
| 13 | 2 | |
| 14 | 4 | |
| 15 | 6 | |
| 16 | 5 | |
| 17 | Some Conditions on Periodicity for Sum-Free Sets | 2 |
| 18 | 2 | |
| 19 | 8 | |
| 20 | 6 |
About Neil J. Calkin
Neil J. Calkin is a scholar working on Discrete Mathematics and Combinatorics, Algebra and Number Theory and Geometry and Topology, having authored 48 papers that have together received 504 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (15 papers), Advanced Graph Theory Research (8 papers) and Mathematical Dynamics and Fractals (8 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (177 citations), Algebra and Number Theory (99 citations) and Computational Theory and Mathematics (240 citations). Neil J. Calkin has collaborated with scholars based in United States, Canada and Hungary. Frequent co-authors include Herbert S. Wilf, Peter Dankelmann, J. D. Key, Marcos López de Prado, Alan Frieze, Criel Merino, Marc Noy, Steven D. Noble, Steven R. Finch and Kevin James. Their work appears in journals such as Mathematics of Computation, American Mathematical Monthly and Journal of Computational and Applied 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.