[1] R. Ahlswede, H. S. Haroutunian, and L. H. Khachatrian, Messy Broadcasting in Networks, Communications and Cryptography, eds. R. E. Blahut, D. J. Costello, Jr., U. Mauter, and T. Mittelholzer (Kluwer, Boston/Dordrecht/London, 1994) 13-24.

[2] J.-C. Bermond, P. Fraigniaud, J. Peters, Antepenultimate broadcasting, Networks 26 (1995) 125-137.

[3] A. M. Farley, Minimal broadcast networks. Networks 9 (1979) 313-332.

[4] A. M. Farley, S. Hedetniemi, S. Mitchell, and A. Proskurowski, Minimum broadcast graphs. Discrete Math 25 (1979) 189-193.

[5] P. Fraigniaud and E. Lazard, Methods and problems of communication in usual networks, Discrete Applied Mathematics 53, pp. 79-133, 1994.

[6] M. Grigni, D. Peleg, Tight bounds on minimum broadcast networks, SIAM J. Discrete Math. 4 (1991) 207-222.

[7] H. A. Harutyunyan and A. L. Liestman, Improved upper and lower bounds for k-Broadcasting, Networks 37(2), 94-101, 2001.

[8] H. A. Harutyunyan and A. L. Liestman, Messy Broadcasting, Parallel Processing Letters Vol. 8 No. 2, pp. 149-159, 1998.

[9] H. A. Harutyunyan and A. L. Liestman, More Broadcast Graphs, Discrete Applied Mathematics 98, pp.81-102, 1999.

[10] S. T. Hedetniemi, S. M. Hedetniemi and A. L. Liestman, A survey of broadcasting and gossiping in communication networks, Networks 18 (1988) 319-349.

[11] L. H. Khachatrian, H. S. Haroutunian, Construction of new classes of minimal broadcast networks, Proceedings of the Third International Coloquium on Coding Theory, 1990, pp.69-77.

[12] W. Knödel, New gossips and telephones. Discrete Math 13 (1975) 95.

[13] A. L. Liestman and J. G. Peters, Minimum broadcast digraphs, Discrete Applied Mathematics 37/38 (1992) 401-419.