# Edgar M. Palmer

According to our database

Collaborative distances:

^{1}, Edgar M. Palmer authored at least 20 papers between 1967 and 2007.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepage:

#### On csauthors.net:

## Bibliography

2007

Counting labeled general cubic graphs.

Discrete Mathematics, 2007

2003

The asymptotic number of claw-free cubic graphs.

Discrete Mathematics, 2003

2002

Counting Claw-Free Cubic Graphs.

SIAM J. Discrete Math., 2002

Geodetic number of random graphs of diameter 2.

Australasian J. Combinatorics, 2002

2001

On the spanning tree packing number of a graph: a survey.

Discrete Mathematics, 2001

1996

On the asymptotic behavior of the independence number of a random (

*n, n*)-tree.
Graphs and Combinatorics, 1996

1995

On the expected number of edges in a maximum matching of an (r, s)-tree.

Int. J. Comput. Math., 1995

1991

Matchings and cycle covers in random digraphs.

Discrete Applied Mathematics, 1991

1990

Asymptotic number of symmetries in locally restricted trees.

Discrete Applied Mathematics, 1990

1984

Redfield's lost paper in a modern context.

Journal of Graph Theory, 1984

1983

Local connectivity of a random graph.

Journal of Graph Theory, 1983

Points by degree and orbit size in chemical trees, II.

Discrete Applied Mathematics, 1983

1979

On the number of trees in a random forest.

J. Comb. Theory, Ser. B, 1979

1977

The number of self-complementary achiral necklaces.

Journal of Graph Theory, 1977

Enumeration of graphs with signed points and lines.

Journal of Graph Theory, 1977

1975

On the cell-growth problem for arbitrary polygons.

Discrete Mathematics, 1975

1974

Efficiency of a Binary Comparison Storage Technique.

J. ACM, 1974

1973

On the number of n-plexes.

Discrete Mathematics, 1973

Graphical enumeration.

Addison-Wesley, ISBN: 978-0-12-324245-7, 1973

1967

Enumeration of Finite Automata

Information and Control, May, 1967