1. Fault-tolerant minimum broadcast networks;Ahlswede;Networks,1996
2. A. Averbuch, I. Peeri, Y. Rodity, Improved upper bound on m-time-relaxed k-broadcasting communication networks. Tel Aviv University. http://www.cs.tau.ac.il/~amir1/PS/IRIT-P.pdf (accessed 28.02.15).
3. Construction of minimum time-relaxed broadcasting communication networks;Averbuch;J. Combin. Math. Combin. Comput.,2002
4. Efficient construction of broadcast graphs;Averbuch;Discrete Appl. Math.,2014
5. Tight lower bounds on broadcast function for n=24 and 25;Barsky;Discrete Appl. Math.,2014