Counting algorithms for connected labelled graphs / D.D. Cowan, R.C. Mullin, and R.G. Stanton.
- SCA190-GA165-5-86
- File
- January 20, 1975-February 20, 1975
Part of Dr. Donald D. Cowan fonds.
Two copies of a typed manuscript titled, "Counting algorithms for connected labelled graphs" by Donald Cowan, R.C. Mullin, and Ralph G. Stanton. The manuscript is twelve pages. This paper was presented at the sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing held at Florida Atlantic University in Boca Raton, Florida between February 17-20, 1975. This paper was subsequently published in the Proceedings of the sixth Southeastern Conference on Combinatorics, Graph Theory, and Computing, pages 219-231. Also includes correspondence related to the submission of the paper to the conference.
Cowan, Donald D.