1. C.G. Bird, “On cost allocation for a spanning tree: A game theory approach”,Networks 6 (1976) 335–350.
2. A. Claus and D.J. Kleitman, “Cost-allocation for a spanning tree”,Networks 3 (1973) 289–304.
3. A. Claus and D. Granot, “Game theory application to cost allocation for a spanning tree”, Working Paper No. 402, Faculty of Commerce and Business Administration, University of British Columbia (June 1976).
4. D. Granot and G. Huberman, “Minimum cost spanning tree games”, Working Paper No. 403, Faculty of Commerce, U.B.C. (June 1976; revised Sept. 1976/August 1977).
5. D. Granot and G. Huberman, “Permutationally convex games and minimum spanning tree games”, Discussion Paper 77-10-3, Simon Fraser University (June 1977).