REFERENCES
- Bapeswara Rao & Murti (V G K). Enumeration of All Trees of a Graph Computer Program. Electronics Letters. 6, 4; 1970.
- Char (J P), Generation of Trees, Two-Trees, and Storage of Master Forests. IEEE Trans. CT-15, 1968; 228–238.
- Deo (N). Graph Theory with Applications to Engineering and Computer Science. 1974. Prentice-Hall Inc., Englewood Cliffs, N.J.
- Minty (G J). A Simple Algorithm for Listing All the Trees of a Graph. IEEE Trans. CT-12, 1965; 120.
- Hakimi (S L). On the Trees of a Graph and Their Generation. J. Franklin Inst. 270, 1961; 347–359.
- Hakimi (S L) & Green (D G). Generation and Realization of Trees and k-Trees. IEEE Trans. CT-12, 1965; 181–185.
- Peikarski (M). Listing of All Possible Trees of a Linear Graph. Ibid., CT-12, 1965, Correspondence, 124–125.
- Seppanen (J J). Algorithm 399: Spanning Tree. Comm. ACM. 13, 10; 1970; 621–622.
- Seshu (S) & Reed (M B). Linear Graphs and Electrical Networks. Reading, Mass, Addison-Wesley, 1961.
- Weinberg (L). Number of Trees in a Graph. Proc. IRE (Corresp.) 46, 1958; 1954–1955.
- Mayeda (W) & Seshu (S). Generation of Trees without Duplications. IEEE Trans. CT-12, June 1965; 181–185.
- Mayeda (W). Graph Theory. Wiley Interscience, 1972.