Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Palmer, E.M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the asymptotic behavior of the independence number of a random
(n,n)
-tree
J.H. Cho
,
E.M. Palmer
Graphs and Combinatorics
12
, 1996, pp. 1-8
Matchings and cycle covers in random digraphs
John Gimbel
,
E.M. Palmer
Discrete Applied Mathematics
34
, 1991, pp. 121-128
Asymptotic number of symmetries in locally restricted trees
J.W. Kennedy
,
K.A. McKeon
,
E.M. Palmer
,
R.W. Robinson
Discrete Applied Mathematics
26
, 1990, pp. 121-124
Redfield's lost paper in a modern context
J.I. Hall
,
E.M. Palmer
,
R.W. Robinson
Journal of Graph Theory
8
(2), 1984, pp. 225-240
Points by degree and orbit size in chemical trees, II
C.K. Bailey
,
J.W. Kennedy
,
E.M. Palmer
Discrete Applied Mathematics
5
, 1983, pp. 157-164
Local connectivity of a random graph
P. Erdŏs
,
E.M. Palmer
,
R.W. Robinson
Journal of Graph Theory
7
(4), 1983, pp. 411-417
On the number of trees in a random forest
E.M. Palmer
,
A.J. Schwenk
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 109-121
The number of self-complementary achiral necklaces
E.M. Palmer
,
A.J. Schwenk
Journal of Graph Theory
1
(4), 1977, pp. 309-315
Efficiency of a binary comparison storage technique
E.M. Palmer
,
M.A. Rahimi
,
R.W. Robinson
Journal of the ACM
21
, 1974, pp. 376-384