1. Some APX-completeness results for cubic graphs;Alimonti;Theoret. Comput. Sci.,2000
2. The Probabilistic Method;Alon,2000
3. G. Araujo-Pardo, L. Barrière, Defensive alliances in regular graphs and circulant graphs. Preprint 2008. Available at http://upcommons.upc.edu/e-prints/bitstream/2117/2284/1/aliances1002.pdf.
4. Dominating sets in chordal graphs;Booth;SIAM J. Comput.,1982
5. On the complexity of finding optimal global alliances;Cami;J. Combin. Math. Combin. Comput.,2006