Edgar M. Palmer

Mathematics

Gab-Byung Chae	grad student	2001	Michigan State
Wai C. Siu	grad student	2002	Michigan State

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.
Chae GB, Palmer EM, Robinson RW. (2007) Counting labeled general cubic graphs Discrete Mathematics. 307: 2979-2992
Palmer EM, Read RC, Robinson RW. (2003) Counting claw-free cubic graphs Siam Journal On Discrete Mathematics. 16: 65-73
McKay BD, Palmer EM, Read RC, et al. (2003) The asymptotic number of claw-free cubic graphs Discrete Mathematics. 272: 107-118
Chae GB, Palmer EM, Siu WC. (2002) Geodetic number of random graphs of diameter 2 Australasian Journal of Combinatorics. 26: 11-20
Palmer EM. (2001) On the spanning tree packing number of a graph: A survey Discrete Mathematics. 230: 13-21
Palmer EM, Spencer JJ. (1995) Hitting time for k edge-disjoint spanning trees in a random graph Periodica Mathematica Hungarica. 31: 235-240
Palmer EM. (1993) Quo Vadis, Random Graph Theory? Annals of Discrete Mathematics. 55: 341-348
Gimbel J, Palmer EM. (1991) Matchings and cycle covers in random digraphs Discrete Applied Mathematics. 34: 121-128
Kennedy JW, McKeon KA, Palmer EM, et al. (1990) Asymptotic number of symmetries in locally restricted trees Discrete Applied Mathematics. 26: 121-124
Palmer EM. (1987) Unsolved Problems in the Theory of Random Graphs North-Holland Mathematics Studies. 144: 227-239