1. M. Atici, Optimal information and average information rates of the connected graphs on six vertices, Master's thesis, University of Nebraska, May 1994.
2. C. Blundo, Secret Sharing Schemes for Access Structures based on Graphs, Tesi di Laurea (1991) (in Italian).
3. C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the information rate of secret sharing schemes, InAdvances in Cryptology-CRYPTO '92, Lecture Notes in Comput. Sci., Vol. 740, pp. 148?167 (1993).
4. C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph decompositions and secret sharing schemes,? InAdvances in Cryptology-Proceedings of Eurocrypt '92, Lecture Notes in Comput. Sci., Vol. 658 (1993) pp. 1?24.
5. E. F. Brickell, Some ideal secret sharing schemes,J. Combin. Math. and Combin. Comput., Vol. 9 (1989) pp. 105?113.