default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdgar M. Palmer
Person information
- affiliation: Michigan State University, East Lansing, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j19]Gab-Byung Chae, Edgar M. Palmer, Robert W. Robinson:
Counting labeled general cubic graphs. Discret. Math. 307(23): 2979-2992 (2007)- 2003
- [j18]Brendan D. McKay
, Edgar M. Palmer, Ronald C. Read, Robert W. Robinson:
The asymptotic number of claw-free cubic graphs. Discret. Math. 272(1): 107-118 (2003) - 2002
- [j17]Gab-Byung Chae, Edgar M. Palmer, Wai-Cheong Siu:
Geodetic number of random graphs of diameter 2. Australas. J Comb. 26: 11-20 (2002) - [j16]Edgar M. Palmer, Ronald C. Read, Robert W. Robinson:
Counting Claw-Free Cubic Graphs. SIAM J. Discret. Math. 16(1): 65-73 (2002) - 2001
- [j15]Edgar M. Palmer:
On the spanning tree packing number of a graph: a survey. Discret. Math. 230(1-3): 13-21 (2001)
1990 – 1999
- 1996
- [j14]J. H. Cho, Edgar M. Palmer:
On the asymptotic behavior of the independence number of a random (n, n)-tree. Graphs Comb. 12(1): 1-8 (1996) - 1995
- [j13]J. H. Cho, Edgar M. Palmer:
On the expected number of edges in a maximum matching of an (r, s)-tree. Int. J. Comput. Math. 56(1-2): 39-50 (1995) - 1991
- [j12]John Gimbel, Edgar M. Palmer:
Matchings and cycle covers in random digraphs. Discret. Appl. Math. 34(1-3): 121-128 (1991) - 1990
- [j11]J. W. Kennedy, K. A. McKeon, Edgar M. Palmer, Robert W. Robinson:
Asymptotic number of symmetries in locally restricted trees. Discret. Appl. Math. 26(1): 121-124 (1990)
1980 – 1989
- 1984
- [j10]J. I. Hall, Edgar M. Palmer, Robert W. Robinson:
Redfield's lost paper in a modern context. J. Graph Theory 8(2): 225-240 (1984) - 1983
- [j9]C. K. Bailey, Edgar M. Palmer, J. W. Kennedy:
Points by degree and orbit size in chemical trees, II. Discret. Appl. Math. 5(2): 157-164 (1983) - [j8]Paul Erdös, Edgar M. Palmer, Robert W. Robinson:
Local connectivity of a random graph. J. Graph Theory 7(4): 411-417 (1983)
1970 – 1979
- 1979
- [j7]Edgar M. Palmer, Allen J. Schwenk:
On the number of trees in a random forest. J. Comb. Theory B 27(2): 109-121 (1979) - 1977
- [j6]Frank Harary, Edgar M. Palmer, Robert W. Robinson, Allen J. Schwenk:
Enumeration of graphs with signed points and lines. J. Graph Theory 1(4): 295-308 (1977) - [j5]Edgar M. Palmer, Allen J. Schwenk:
The number of self-complementary achiral necklaces. J. Graph Theory 1(4): 309-315 (1977) - 1975
- [j4]Frank Harary, Edgar M. Palmer, Ronald C. Read:
On the cell-growth problem for arbitrary polygons. Discret. Math. 11(3): 371-389 (1975) - 1974
- [j3]Edgar M. Palmer, M. A. Rahimi, Robert W. Robinson:
Efficiency of a Binary Comparison Storage Technique. J. ACM 21(3): 376-384 (1974) - 1973
- [b1]Frank Harary, Edgar M. Palmer:
Graphical enumeration. Addison-Wesley 1973, ISBN 978-0-12-324245-7, pp. I-XIV, 1-271 - [j2]Edgar M. Palmer:
On the number of n-plexes. Discret. Math. 6(4): 377-390 (1973)
1960 – 1969
- 1967
- [j1]Frank Harary, Edgar M. Palmer:
Enumeration of Finite Automata. Inf. Control. 10(5): 499-508 (1967)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
