Peter D. Johnson

460 total citations
43 papers, 231 citations indexed

About

Peter D. Johnson is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Geometry and Topology. According to data from OpenAlex, Peter D. Johnson has authored 43 papers receiving a total of 231 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 17 papers in Discrete Mathematics and Combinatorics and 12 papers in Geometry and Topology. Recurrent topics in Peter D. Johnson's work include Advanced Graph Theory Research (22 papers), Graph Labeling and Dimension Problems (17 papers) and Limits and Structures in Graph Theory (13 papers). Peter D. Johnson is often cited by papers focused on Advanced Graph Theory Research (22 papers), Graph Labeling and Dimension Problems (17 papers) and Limits and Structures in Graph Theory (13 papers). Peter D. Johnson collaborates with scholars based in United States, United Kingdom and Lebanon. Peter D. Johnson's co-authors include Gregory Harris, A. J. W. Hilton, D. G. Hoffman, Kenneth J. Roblee, Weijiong Chen, Mohammad Hamidian, J. C. Davis, Douglas G. Rogers, Changiz Eslahchi and S. Uchida and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Nature Materials and SHILAP Revista de lepidopterología.

In The Last Decade

Peter D. Johnson

38 papers receiving 204 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Peter D. Johnson United States	7	105	62	56	44	42	43	231
Frank R. Bernhart United States	3	122 1.2×	29 0.5×	59 1.1×	17 0.4×	56 1.3×	5	240
J. Koch United States	3	244 2.3×	24 0.4×	91 1.6×	17 0.4×	55 1.3×	4	352
Ming-Deh A. Huang United States	12	268 2.6×	297 4.8×	21 0.4×	28 0.6×	33 0.8×	41	603
William J. Gilbert Canada	13	189 1.8×	49 0.8×	17 0.3×	44 1.0×	9 0.2×	23	424
Ludwig Danzer Germany	11	95 0.9×	13 0.2×	56 1.0×	27 0.6×	47 1.1×	18	369
Mary Flahive United States	7	78 0.7×	37 0.6×	21 0.4×	13 0.3×	32 0.8×	13	240
Sándor Szabó Hungary	9	169 1.6×	126 2.0×	108 1.9×	21 0.5×	183 4.4×	71	398
Mark Walters United Kingdom	10	122 1.2×	27 0.4×	113 2.0×	21 0.5×	42 1.0×	25	356
U. Betke Germany	13	78 0.7×	19 0.3×	91 1.6×	34 0.8×	18 0.4×	31	401
Viresh Patel United Kingdom	10	121 1.2×	24 0.4×	50 0.9×	4 0.1×	94 2.2×	38	282

Countries citing papers authored by Peter D. Johnson

Since Specialization

Citations

This map shows the geographic impact of Peter D. Johnson'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 Peter D. Johnson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Peter D. Johnson more than expected).

Fields of papers citing papers by Peter D. Johnson

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Peter D. Johnson. 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 Peter D. Johnson. The network helps show where Peter D. Johnson may publish in the future.

Co-authorship network of co-authors of Peter D. Johnson

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

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

França, Daniel Stilck, et al.. (2025). Efficient ground-state-energy estimation and certification on early fault-tolerant quantum computers. Physical review. A. 111(1). 4 indexed citations

Johnson, Peter D., et al.. (2024). On proving the robustness of algorithms for early fault-tolerant quantum computers. Quantum. 8. 1531–1531. 4 indexed citations

Wang, Shuqiu, et al.. (2024). Discovery of orbital ordering in Bi2Sr2CaCu2O8+x. Nature Materials. 23(4). 492–498. 3 indexed citations

Johnson, Peter D., et al.. (2023). Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods. Physical review. A. 108(2). 3 indexed citations

Johnson, Peter D., et al.. (2017). Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles. SHILAP Revista de lepidopterología. 4(2). 1–9. 1 indexed citations

Johnson, Peter D., et al.. (2015). Estimates of the choice numbers and the Ohba numbers of some complete multipartite graphs.. Ars Combinatoria. 119. 167–176. 1 indexed citations

Johnson, Peter D., et al.. (2015). Forbidding Rainbow Cycles with Edge-Colorings of \(K_{m,n}\). 38. 1 indexed citations

Coolsaet, Kris, et al.. (2012). Some extremal problems for edge-regular graphs. Ghent University Academic Bibliography (Ghent University). 5 indexed citations

Isaak, Garth, et al.. (2012). Integer and fractional security in graphs. Discrete Applied Mathematics. 160(13-14). 2060–2062. 5 indexed citations

10.

Johnson, Peter D., et al.. (2011). Completing partial latin squares: Cropper's question.. Australas. J Comb.. 49. 127–152. 3 indexed citations

11.

Johnson, Peter D., et al.. (2010). List multicoloring problems involving the k-fold Hall numbers. Journal of Graph Theory. 65(1). 16–34.

12.

Johnson, Peter D. & R. N. Mohapatra. (2005). A class of inequalities relating degrees of adjacent nodes to the average degree in edge‐weighteduniform hypergraphs. International Journal of Mathematics and Mathematical Sciences. 2005(21). 3419–3426. 1 indexed citations

13.

Johnson, Peter D., et al.. (2004). The Actions of Fractional Automorphisms. Journal of Combinatorial Mathematics and Combinatorial Computing. 2004(50). 1 indexed citations

14.

Jamison, Robert E. & Peter D. Johnson. (2003). The structure of (t,r)-regular graphs of large order. Discrete Mathematics. 272(2-3). 297–300.

15.

Johnson, Peter D. & Kenneth J. Roblee. (2002). On an extremal subfamily of an extremal family of nearly strongly regular graphs.. Australas. J Comb.. 25. 279–284. 4 indexed citations

16.

Harary, Frank & Peter D. Johnson. (2001). The Shields-Harary indices of vulnerability of a graph. Mathematical and Computer Modelling. 34(3-4). 299–310. 1 indexed citations

17.

Eslahchi, Changiz, et al.. (2000). Progress on the Hall-Number-Two problem.. Australas. J Comb.. 21. 211–236. 5 indexed citations

18.

Hilton, A. J. W. & Peter D. Johnson. (1999). The Hall number, the Hall index, and the total Hall number of a graph. Discrete Applied Mathematics. 94(1-3). 227–245. 12 indexed citations

19.

Hilton, A. J. W. & Peter D. Johnson. (1989). Graphs which are vertex‐critical with respect to the edge‐chromatic class. Mathematika. 36(2). 241–252. 2 indexed citations

20.

Johnson, Peter D.. (1982). Coloring abelian groups. Discrete Mathematics. 40(2-3). 219–223. 11 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