Robert L. Hemminger
Impact in
-
- Limits and Structures in Graph Theory
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- semigroups and automata theory
Papers in
-
- Limits and Structures in Graph Theory 6
-
- Advanced Graph Theory Research 20
- Graph Labeling and Dimension Problems 6
- Co-authors
- J. A. BondyR. E. L. AldredKatsuhiro OtaXingxing YuNathaniel DeanM. N. EllinghamMichael D. PlummerBohdan Zelinka
- Journals
- Journal of Graph Theory (7 papers)Discrete Mathematics (4 papers)Journal of Combinatorial Theory Series B (3 papers)Duke Mathematical Journal (2 papers)Transactions of the American Mathematical Society (2 papers)
- Partner nations
- United StatesNew ZealandJapan
In The Last Decade
Robert L. Hemminger
29 papers receiving 280 citations
Peers
Comparison fields: 5 of 51
- Discrete Mathematics and Combinatorics 72
- Computational Theory and Mathematics 257
- Geometry and Topology 100
- Algebra and Number Theory 36
- Computer Graphics and Computer-Aided Design 20
Countries citing papers authored by Robert L. Hemminger
This map shows the geographic impact of Robert L. Hemminger'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 Robert L. Hemminger with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Robert L. Hemminger more than expected).
Fields of papers citing papers by Robert L. Hemminger
This network shows the impact of papers produced by Robert L. Hemminger. 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 Robert L. Hemminger. The network helps show where Robert L. Hemminger may publish in the future.
Co-authors
The 13 scholars most cited alongside Robert L. Hemminger, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | Cycles in quasi 4-connected graphs. | 1997 | 1 |
| 2 | 1997 | 10 | |
| 3 | On Hamilton cycles and contractible edges in 3-connected graphs. | 1995 | 1 |
| 4 | 1994 | 5 | |
| 5 | 1993 | 4 | |
| 6 | Maximum matchings in 3-connected graphs contain contractible edges. | 1992 | 4 |
| 7 | 1992 | 4 | |
| 8 | 1982 | 4 | |
| 9 | 1976 | 3 | |
| 10 | 1974 | 44 | |
| 11 | 1973 | 3 | |
| 12 | 1973 | 6 | |
| 13 | 1972 | 2 | |
| 14 | 1971 | 5 | |
| 15 | 1969 | 13 | |
| 16 | 1968 | 20 | |
| 17 | 1966 | 5 | |
| 18 | 1966 | 3 | |
| 19 | 1966 | 6 | |
| 20 | 1966 | 0 |
About Robert L. Hemminger
Robert L. Hemminger is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Computer Graphics and Computer-Aided Design, Geometry and Topology and Theoretical Computer Science, having authored 33 papers that have together received 354 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (20 papers), Interconnection Networks and Systems (10 papers), graph theory and CDMA systems (7 papers), Graph Labeling and Dimension Problems (6 papers), Limits and Structures in Graph Theory (6 papers), Graph theory and applications (5 papers), Computational Geometry and Mesh Generation (4 papers) and Graph Theory and Algorithms (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (72 citations), Computational Theory and Mathematics (257 citations), Geometry and Topology (100 citations), Algebra and Number Theory (36 citations) and Computer Graphics and Computer-Aided Design (20 citations). Robert L. Hemminger has collaborated with scholars based in United States, New Zealand and Japan. Frequent co-authors include J. A. Bondy, R. E. L. Aldred, Katsuhiro Ota, Xingxing Yu, Nathaniel Dean, M. N. Ellingham, Michael D. Plummer, Bohdan Zelinka, Lowell W. Beineke and H. A. Jung. Their work appears in journals such as Journal of Graph Theory, Discrete Mathematics, Journal of Combinatorial Theory Series B, Duke Mathematical Journal and Transactions of the American Mathematical Society.
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.