2007 |
8 | EE | Gab-Byung Chae,
Edgar M. Palmer,
Robert W. Robinson:
Counting labeled general cubic graphs.
Discrete Mathematics 307(23): 2979-2992 (2007) |
2003 |
7 | EE | Brendan D. McKay,
Edgar M. Palmer,
Ronald C. Read,
Robert W. Robinson:
The asymptotic number of claw-free cubic graphs.
Discrete Mathematics 272(1): 107-118 (2003) |
2002 |
6 | EE | Edgar M. Palmer,
Ronald C. Read,
Robert W. Robinson:
Counting Claw-Free Cubic Graphs.
SIAM J. Discrete Math. 16(1): 65-73 (2002) |
2001 |
5 | EE | Edgar M. Palmer:
On the spanning tree packing number of a graph: a survey.
Discrete Mathematics 230(1-3): 13-21 (2001) |
1991 |
4 | EE | John Gimbel,
Edgar M. Palmer:
Matchings and cycle covers in random digraphs.
Discrete Applied Mathematics 34(1-3): 121-128 (1991) |
1990 |
3 | EE | J. W. Kennedy,
K. A. McKeon,
Edgar M. Palmer,
Robert W. Robinson:
Asymptotic number of symmetries in locally restricted trees.
Discrete Applied Mathematics 26(1): 121-124 (1990) |
1979 |
2 | EE | Edgar M. Palmer,
Allen J. Schwenk:
On the number of trees in a random forest.
J. Comb. Theory, Ser. B 27(2): 109-121 (1979) |
1974 |
1 | EE | Edgar M. Palmer,
M. A. Rahimi,
Robert W. Robinson:
Efficiency of a Binary Comparison Storage Technique.
J. ACM 21(3): 376-384 (1974) |