Enumeration of Finite Automata - Frank Harary; Edgar M. Palmer (Inf. Control., 1967)

Graphical enumeration. - Frank Harary; Edgar M. Palmer (Addison-Wesley, 1973)

On the number of n-plexes. - Edgar M. Palmer (Discret. Math., 1973)

Efficiency of a Binary Comparison Storage Technique. - Edgar M. Palmer; M. A. Rahimi; Robert W. Robinson (J. ACM, 1974)

On the cell-growth problem for arbitrary polygons. - Frank Harary; Edgar M. Palmer; Ronald C. Read (Discret. Math., 1975)

Enumeration of graphs with signed points and lines. - Frank Harary; Edgar M. Palmer; Robert W. Robinson; Allen J. Schwenk (J. Graph Theory, 1977)

The number of self-complementary achiral necklaces. - Edgar M. Palmer; Allen J. Schwenk (J. Graph Theory, 1977)

On the number of trees in a random forest. - Edgar M. Palmer; Allen J. Schwenk (J. Comb. Theory B, 1979)

Points by degree and orbit size in chemical trees, II. - C. K. Bailey; Edgar M. Palmer; J. W. Kennedy (Discret. Appl. Math., 1983)

Local connectivity of a random graph. - Paul Erdös; Edgar M. Palmer; Robert W. Robinson (J. Graph Theory, 1983)

Redfield's lost paper in a modern context. - J. I. Hall; Edgar M. Palmer; Robert W. Robinson (J. Graph Theory, 1984)

Asymptotic number of symmetries in locally restricted trees. - J. W. Kennedy; K. A. McKeon; Edgar M. Palmer; Robert W. Robinson (Discret. Appl. Math., 1990)

Matchings and cycle covers in random digraphs. - John Gimbel; Edgar M. Palmer (Discret. Appl. Math., 1991)

On the expected number of edges in a maximum matching of an (r, s)-tree. - J. H. Cho; Edgar M. Palmer (Int. J. Comput. Math., 1995)

On the asymptotic behavior of the independence number of a random (n, n)-tree. - J. H. Cho; Edgar M. Palmer (Graphs Comb., 1996)

On the spanning tree packing number of a graph: a survey. - Edgar M. Palmer (Discret. Math., 2001)

Geodetic number of random graphs of diameter 2. - Gab-Byung Chae; Edgar M. Palmer; Wai-Cheong Siu (Australas. J Comb., 2002)

Counting Claw-Free Cubic Graphs. - Edgar M. Palmer; Ronald C. Read; Robert W. Robinson (SIAM J. Discret. Math., 2002)

The asymptotic number of claw-free cubic graphs. - Brendan D. McKay; Edgar M. Palmer; Ronald C. Read; Robert W. Robinson (Discret. Math., 2003)

Counting labeled general cubic graphs. - Gab-Byung Chae; Edgar M. Palmer; Robert W. Robinson (Discret. Math., 2007)