Edgar M. Palmer

Affiliations:
  • Michigan State University, East Lansing, USA


According to our database1, Edgar M. Palmer authored at least 20 papers between 1967 and 2007.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2007
Counting labeled general cubic graphs.
Discret. Math., 2007

2003
The asymptotic number of claw-free cubic graphs.
Discret. Math., 2003

2002
Counting Claw-Free Cubic Graphs.
SIAM J. Discret. Math., 2002

Geodetic number of random graphs of diameter 2.
Australas. J Comb., 2002

2001
On the spanning tree packing number of a graph: a survey.
Discret. Math., 2001

1996
On the asymptotic behavior of the independence number of a random (<i>n, n</i>)-tree.
Graphs Comb., 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.
Discret. Appl. Math., 1991

1990
Asymptotic number of symmetries in locally restricted trees.
Discret. Appl. Math., 1990

1984
Redfield's lost paper in a modern context.
J. Graph Theory, 1984

1983
Local connectivity of a random graph.
J. Graph Theory, 1983

Points by degree and orbit size in chemical trees, II.
Discret. Appl. Math., 1983

1979
On the number of trees in a random forest.
J. Comb. Theory B, 1979

1977
The number of self-complementary achiral necklaces.
J. Graph Theory, 1977

Enumeration of graphs with signed points and lines.
J. Graph Theory, 1977

1975
On the cell-growth problem for arbitrary polygons.
Discret. Math., 1975

1974
Efficiency of a Binary Comparison Storage Technique.
J. ACM, 1974

1973
On the number of n-plexes.
Discret. Math., 1973

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

1967
Enumeration of Finite Automata
Inf. Control., May, 1967


  Loading...