Edgar M. Palmer

1.1k total citations
42 papers, 636 citations indexed

About

Edgar M. Palmer is a scholar working on Geometry and Topology, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Edgar M. Palmer has authored 42 papers receiving a total of 636 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Geometry and Topology, 21 papers in Computational Theory and Mathematics and 16 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Edgar M. Palmer's work include Advanced Graph Theory Research (16 papers), Graph theory and applications (15 papers) and Limits and Structures in Graph Theory (9 papers). Edgar M. Palmer is often cited by papers focused on Advanced Graph Theory Research (16 papers), Graph theory and applications (15 papers) and Limits and Structures in Graph Theory (9 papers). Edgar M. Palmer collaborates with scholars based in United States, Canada and Australia. Edgar M. Palmer's co-authors include Frank Harary, Robert W. Robinson, John H. White, Jordi Yagüe, Philippa Marrack, Christopher Coleclough, John W. Kappler, Ronald C. Read, Osvald Knop and Allen J. Schwenk and has published in prestigious journals such as Cell, Journal of the ACM and Psychometrika.

In The Last Decade

Edgar M. Palmer

40 papers receiving 551 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Edgar M. Palmer United States	11	213	147	120	110	91	42	636
Marc A. Berger United States	13	187 0.9×	310 2.1×	60 0.5×	39 0.4×	38 0.4×	50	905
Marko Petkovšek Slovenia	18	598 2.8×	48 0.3×	286 2.4×	235 2.1×	42 0.5×	74	1.3k
Harold N. Shapiro United States	15	125 0.6×	23 0.2×	154 1.3×	47 0.4×	14 0.2×	54	893
Jian Ding United States	16	85 0.4×	20 0.1×	63 0.5×	57 0.5×	69 0.8×	55	688
Konrad Engel Germany	14	176 0.8×	2 0.0×	96 0.8×	180 1.6×	41 0.5×	49	661
W. A. Beyer United States	12	134 0.6×	5 0.0×	85 0.7×	23 0.2×	64 0.7×	54	917
R. Balasubramanian India	14	77 0.4×	14 0.1×	182 1.5×	79 0.7×	27 0.3×	88	690
G Szekeres Australia	18	382 1.8×	3 0.0×	203 1.7×	320 2.9×	69 0.8×	54	1.1k
Omer Angel Canada	12	80 0.4×	63 0.4×	87 0.7×	78 0.7×	25 0.3×	47	796

Countries citing papers authored by Edgar M. Palmer

Since Specialization

Citations

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

Fields of papers citing papers by Edgar M. Palmer

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Edgar M. Palmer

This figure shows the co-authorship network connecting the top 25 collaborators of Edgar M. Palmer. A scholar is included among the top collaborators of Edgar M. Palmer 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 Edgar M. Palmer. Edgar M. Palmer 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

Palmer, Edgar M., et al.. (2007). Counting labeled general cubic graphs. Discrete Mathematics. 307(23). 2979–2992. 5 indexed citations

Palmer, Edgar M., et al.. (2002). Geodetic number of random graphs of diameter 2.. Australas. J Comb.. 26(52). 11–20. 4 indexed citations

Palmer, Edgar M.. (2001). On the spanning tree packing number of a graph: a survey. Discrete Mathematics. 230(1-3). 13–21. 39 indexed citations

Palmer, Edgar M.. (1997). The Hidden Algorithm of Ore's Theorem on Hamiltonian Cycles. Computers & Mathematics with Applications. 34(11). 113–119. 4 indexed citations

Palmer, Edgar M., et al.. (1996). On the asymptotic behavior of the independence number of a random (n, n)-tree. Graphs and Combinatorics. 12(1). 1–8. 2 indexed citations

Catlin, Paul A., Zhihong Chen, & Edgar M. Palmer. (1993). On the edge arboricity of a random graph. Ars Combinatoria. 129–134. 3 indexed citations

Palmer, Edgar M., Ronald C. Read, & Robert W. Robinson. (1992). Balancing the n-Cube: A Census of Colorings. Journal of Algebraic Combinatorics. 1(3). 257–273. 15 indexed citations

Palmer, Edgar M.. (1992). Matchings in random superpositions of bipartite trees. Journal of Computational and Applied Mathematics. 41(1-2). 199–204. 3 indexed citations

Palmer, Edgar M.. (1985). Graphical evolution: an introduction to the theory of random graphs. John Wiley & Sons, Inc. eBooks. 110 indexed citations

10.

Yagüe, Jordi, John H. White, Christopher Coleclough, et al.. (1985). The T cell receptor: the α and β chains define idiotype, and antigen and MHC specificity. Cell. 42(1). 81–87. 168 indexed citations

11.

Hall, Jonathan I., Edgar M. Palmer, & Robert W. Robinson. (1984). Redfield's lost paper in a modern context. Journal of Graph Theory. 8(2). 225–240. 6 indexed citations

12.

Palmer, Edgar M., et al.. (1983). Points by degree and orbit size in chemical trees, II. Discrete Applied Mathematics. 5(2). 157–164. 2 indexed citations

13.

Harary, Frank & Edgar M. Palmer. (1979). The probability that a point of a tree is fixed. Mathematical Proceedings of the Cambridge Philosophical Society. 85(3). 407–415. 5 indexed citations

14.

Palmer, Edgar M., et al.. (1979). On the number of trees in a random forest. Journal of Combinatorial Theory Series B. 27(2). 109–121. 35 indexed citations

15.

Harary, Frank, Edgar M. Palmer, & Ronald C. Read. (1975). On the cell-growth problem for arbitrary polygons. Discrete Mathematics. 11(3). 371–389. 17 indexed citations

16.

Palmer, Edgar M.. (1969). On the number of labeled 2-trees. Journal of Combinatorial Theory. 6(2). 206–207. 7 indexed citations

17.

Harary, Frank & Edgar M. Palmer. (1968). On acyclic simplicial complexes. Mathematika. 15(1). 115–122. 61 indexed citations

18.

Harary, Frank & Edgar M. Palmer. (1968). On the point-group and line-group of a graph. Acta Mathematica Academiae Scientiarum Hungaricae. 19(3-4). 263–269. 2 indexed citations

19.

Harary, Frank, Edgar M. Palmer, & Ronald C. Read. (1967). The Number of Ways to Label a Structure. Psychometrika. 32(2). 155–156. 10 indexed citations

20.

Harary, Frank & Edgar M. Palmer. (1966). The smallest graph whose group is cyclic. Czechoslovak Mathematical Journal. 16(1). 70–71. 5 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