John Mitchem

568 total citations
29 papers, 318 citations indexed

About

John Mitchem is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Computer Networks and Communications. According to data from OpenAlex, John Mitchem has authored 29 papers receiving a total of 318 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 11 papers in Geometry and Topology and 5 papers in Computer Networks and Communications. Recurrent topics in John Mitchem's work include Advanced Graph Theory Research (19 papers), Graph Labeling and Dimension Problems (16 papers) and Graph theory and applications (8 papers). John Mitchem is often cited by papers focused on Advanced Graph Theory Research (19 papers), Graph Labeling and Dimension Problems (16 papers) and Graph theory and applications (8 papers). John Mitchem collaborates with scholars based in United States. John Mitchem's co-authors include Hudson V. Kronk, E. F. Schmeichel, S. L. Hakimi and Arthur M. Hobbs and has published in prestigious journals such as American Mathematical Monthly, Bulletin of the American Mathematical Society and Proceedings of the American Mathematical Society.

In The Last Decade

John Mitchem

27 papers receiving 277 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
John Mitchem United States 11 270 90 69 58 58 29 318
V. E. Alekseev Russia 9 242 0.9× 97 1.1× 54 0.8× 78 1.3× 52 0.9× 24 297
Jochen Harant Germany 13 408 1.5× 151 1.7× 112 1.6× 68 1.2× 75 1.3× 62 448
Robert Cowen United States 6 191 0.7× 68 0.8× 31 0.4× 43 0.7× 19 0.3× 23 220
Dan Pritikin United States 8 168 0.6× 106 1.2× 78 1.1× 79 1.4× 73 1.3× 24 263
Zevi Miller United States 9 184 0.7× 71 0.8× 89 1.3× 63 1.1× 67 1.2× 29 261
Stephen C. Locke United States 10 263 1.0× 174 1.9× 96 1.4× 60 1.0× 96 1.7× 32 314
H. Meyniel France 11 293 1.1× 108 1.2× 88 1.3× 42 0.7× 58 1.0× 16 343
Margaret B. Cozzens United States 9 198 0.7× 33 0.4× 51 0.7× 75 1.3× 22 0.4× 22 244
Ko‐Wei Lih Taiwan 10 206 0.8× 110 1.2× 63 0.9× 30 0.5× 50 0.9× 24 260
Bert Gerards Netherlands 11 229 0.8× 80 0.9× 37 0.5× 60 1.0× 65 1.1× 19 248

Countries citing papers authored by John Mitchem

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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 of co-authors of John Mitchem

This figure shows the co-authorship network connecting the top 25 collaborators of John Mitchem. A scholar is included among the top collaborators of John Mitchem 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 John Mitchem. John Mitchem is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Mitchem, John, et al.. (2010). On the Erdos-Faber-Lovasz Conjecture.. Ars Combinatoria. 97. 2 indexed citations
2.
Hakimi, S. L., John Mitchem, & E. F. Schmeichel. (1998). Short Proofs of Theorems of Nash-Williams and Tutte.. Ars Combinatoria. 50(2). 139–144. 4 indexed citations
3.
Mitchem, John, et al.. (1997). On the cost-chromatic number of graphs. Discrete Mathematics. 171(1-3). 201–211. 11 indexed citations
4.
Mitchem, John, et al.. (1997). On the cost chromatic number of outerplanar, planar, and line graphs. Discussiones Mathematicae Graph Theory. 17(2). 229–229. 7 indexed citations
5.
Hakimi, S. L., John Mitchem, & E. F. Schmeichel. (1996). Star arboricity of graphs. Discrete Mathematics. 149(1-3). 93–98. 19 indexed citations
6.
Mitchem, John, et al.. (1995). Gale's Round-Trip Jeep Problem. American Mathematical Monthly. 102(4). 299–309. 3 indexed citations
7.
Hakimi, S. L., et al.. (1990). Parallel algorithms for gossiping by mail. Information Processing Letters. 34(4). 197–202. 16 indexed citations
8.
Mitchem, John. (1989). On the harmonious chromatic number of a graph. Discrete Mathematics. 74(1-2). 151–157. 11 indexed citations
9.
Mitchem, John, et al.. (1987). An upper bound for the harmonious chromatic number of a graph. Journal of Graph Theory. 11(4). 565–567. 17 indexed citations
10.
Schmeichel, E. F. & John Mitchem. (1982). Bipartite graphs with cycles of all even lengths. Journal of Graph Theory. 6(4). 429–439. 19 indexed citations
11.
Mitchem, John. (1978). A short proof of Catlin's extension of Brooks' theorem. Discrete Mathematics. 21(2). 213–214. 3 indexed citations
12.
Mitchem, John. (1977). An extension of Brooks' theorem to n-degenerate graphs. Discrete Mathematics. 17(3). 291–298. 15 indexed citations
13.
Hobbs, Arthur M. & John Mitchem. (1976). The entire graph of a bridgeless connected plane graph is hamiltonian. Discrete Mathematics. 16(3). 233–239. 3 indexed citations
14.
Kronk, Hudson V. & John Mitchem. (1975). Critical Point-Arboritic Graphs. Journal of the London Mathematical Society. s2-9(3). 459–466. 38 indexed citations
15.
Kronk, Hudson V. & John Mitchem. (1973). A seven-color theorem on the sphere. Discrete Mathematics. 5(3). 253–260. 27 indexed citations
16.
Kronk, Hudson V. & John Mitchem. (1972). On Dirac's Generalization of Brooks' Theorem. Canadian Journal of Mathematics. 24(5). 805–807. 4 indexed citations
17.
Kronk, Hudson V. & John Mitchem. (1972). The entire chromatic number of a normal graph is at most seven. Bulletin of the American Mathematical Society. 78(5). 799–800. 10 indexed citations
18.
Mitchem, John. (1971). Uniquelyk-arborable graphs. Israel Journal of Mathematics. 10(1). 17–25. 3 indexed citations
19.
Mitchem, John. (1971). On the Point-Arboricity of a Graph and its Complement. Canadian Journal of Mathematics. 23(2). 287–292. 9 indexed citations
20.
Mitchem, John. (1971). On Graphs with Prescribed Clique Number and Point-Arboricity. Journal of the London Mathematical Society. s2-4(2). 333–336. 3 indexed citations

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.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by V. E. Alekseev Breakdown of academic impact, for papers by Jochen Harant Breakdown of academic impact, for papers by Robert Cowen Breakdown of academic impact, for papers by Dan Pritikin Breakdown of academic impact, for papers by Zevi Miller Breakdown of academic impact, for papers by Stephen C. Locke Breakdown of academic impact, for papers by H. Meyniel Breakdown of academic impact, for papers by Margaret B. Cozzens Breakdown of academic impact, for papers by Ko‐Wei Lih Breakdown of academic impact, for papers by Bert Gerards
Rankless by CCL
2026