William Staton
Impact in
-
- Limits and Structures in Graph Theory
- Finite Group Theory Research
- Geometry and Topology top 5%
- Graph theory and applications
Papers in ⓘ
-
- Advanced Graph Theory Research 16
- Graph Labeling and Dimension Problems 5
- semigroups and automata theory 4
- Computability, Logic, AI Algorithms 3
-
- Limits and Structures in Graph Theory 14
- Finite Group Theory Research 2
- Co-authors
- Bing Wei (3 shared papers)J. A. Bondy (1 shared paper)P. Erdös (2 shared papers)Guantao Chen (1 shared paper)Siemion Fajtlowicz (1 shared paper)Paul Erdős (2 shared papers)R. H. Schelp (2 shared papers)Frank Harary (1 shared paper)
- Journals
- Discrete Mathematics (7 papers)Discrete Applied Mathematics (2 papers)Transactions of the American Mathematical Society (2 papers)Journal of Combinatorial Theory Series B (1 paper)Journal of Graph Theory (1 paper)
- Partner nations
- United StatesHungaryCanada
In The Last Decade
William Staton
24 papers receiving 229 citations
Peers
Comparison fields: 5 of 31
- Discrete Mathematics and Combinatorics 146
- Geometry and Topology 125
- Computational Theory and Mathematics 230
- Computer Graphics and Computer-Aided Design 9
- Theoretical Computer Science 2
Countries citing papers authored by William Staton
This map shows the geographic impact of William Staton'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 William Staton with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites William Staton more than expected).
Fields of papers citing papers by William Staton
This network shows the impact of papers produced by William Staton. 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 William Staton. The network helps show where William Staton may publish in the future.
Co-authors
The 9 scholars most cited alongside William Staton, 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 26 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1979 | 55 | |
| 2 | 1982 | 37 | |
| 3 | 1985 | 30 | |
| 4 | 2008 | 27 | |
| 5 | 1984 | 19 | |
| 6 | 1987 | 15 | |
| 7 | 1982 | 15 | |
| 8 | 2010 | 14 | |
| 9 | 1991 | 7 | |
| 10 | 1984 | 7 | |
| 11 | 2011 | 6 | |
| 12 | 1996 | 5 | |
| 13 | 1996 | 4 | |
| 14 | 1979 | 3 | |
| 15 | 1999 | 3 | |
| 16 | 1996 | 3 | |
| 17 | 1987 | 3 | |
| 18 | 1995 | 2 | |
| 19 | On the point linear arboricity of a graph | 1989 | 1 |
| 20 | 1988 | 1 |
About William Staton
William Staton is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Networks and Communications and Mathematical Physics, having authored 26 papers that have together received 261 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (16 papers), Limits and Structures in Graph Theory (14 papers), Graph theory and applications (12 papers), Graph Labeling and Dimension Problems (5 papers), semigroups and automata theory (4 papers), Computability, Logic, AI Algorithms (3 papers), Finite Group Theory Research (2 papers) and Advanced Topology and Set Theory (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (146 citations), Geometry and Topology (125 citations), Computational Theory and Mathematics (230 citations), Computer Graphics and Computer-Aided Design (9 citations) and Theoretical Computer Science (2 citations). William Staton has collaborated with scholars based in United States, Hungary and Canada. Frequent co-authors include Bing Wei, J. A. Bondy, P. Erdös, Guantao Chen, Siemion Fajtlowicz, Paul Erdős, R. H. Schelp, Frank Harary and Ralph J. Faudree. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Transactions of the American Mathematical Society, Journal of Combinatorial Theory Series B 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.