John Mitchem
-
- Limits and Structures in Graph Theory 5
-
- Advanced Graph Theory Research 19
- Graph Labeling and Dimension Problems 16
-
- Computational Geometry and Mesh Generation 3
- Geometry and Topology top 5%
- Graph theory and applications 8
-
- Interconnection Networks and Systems 3
- Optimization and Search Problems 2
-
- graph theory and CDMA systems 3
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsComputer Graphics and Computer-Aided Design
- Journals
- Discrete Mathematics (7 papers)Journal of Graph Theory (3 papers)Journal of the London Mathematical Society (2 papers)
- Partner nations
- United States
In The Last Decade
John Mitchem
27 papers receiving 277 citations
Peers
Comparison fields: 5 of 43
- Discrete Mathematics and Combinatorics 90
- Computational Theory and Mathematics 270
- Computer Graphics and Computer-Aided Design 30
- Geometry and Topology 69
- Computer Networks and Communications 58
Countries citing papers authored by John Mitchem
This map shows the geographic impact of John Mitchem'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 Mitchem with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites John Mitchem more than expected).
Fields of papers citing papers by John Mitchem
This network shows the impact of papers produced by John Mitchem. 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 Mitchem. The network helps show where John Mitchem may publish in the future.
Co-authorship network
The 4 scholars most cited alongside John Mitchem, 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 | On the Erdos-Faber-Lovasz Conjecture. | 2010 | 2 |
| 2 | 1998 | 4 | |
| 3 | 1997 | 11 | |
| 4 | 1997 | 7 | |
| 5 | 1996 | 19 | |
| 6 | 1995 | 3 | |
| 7 | 1990 | 16 | |
| 8 | 1989 | 11 | |
| 9 | 1987 | 17 | |
| 10 | 1982 | 19 | |
| 11 | 1978 | 2 | |
| 12 | 1978 | 3 | |
| 13 | 1977 | 15 | |
| 14 | 1976 | 3 | |
| 15 | 1973 | 27 | |
| 16 | 1972 | 10 | |
| 17 | 1972 | 4 | |
| 18 | 1971 | 3 | |
| 19 | 1971 | 9 | |
| 20 | 1971 | 3 |
About John Mitchem
John Mitchem is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 29 papers that have together received 318 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (19 papers), Graph Labeling and Dimension Problems (16 papers), Graph theory and applications (8 papers), Limits and Structures in Graph Theory (5 papers), Interconnection Networks and Systems (3 papers), Computational Geometry and Mesh Generation (3 papers), graph theory and CDMA systems (3 papers) and Optimization and Search Problems (2 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (90 citations), Computational Theory and Mathematics (270 citations), Computer Graphics and Computer-Aided Design (30 citations), Geometry and Topology (69 citations) and Computer Networks and Communications (58 citations). John Mitchem has collaborated with scholars based in United States. Frequent co-authors include Hudson V. Kronk, E. F. Schmeichel, S. L. Hakimi and Arthur M. Hobbs. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Journal of the London Mathematical Society, Canadian Journal of Mathematics and Duke Mathematical Journal.
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.