1. Irredundant Ramsey numbers for graphs;Brewster;J. Graph Theory,1989
2. Changing and unchanging the domination number of a graph;Carrington;J. Combin. Math. Combin. Comput.,1991
3. The irredundant Ramsey number s(4,4);Cockayne;Utilitas Math.,1992
4. What makes an irredundant set maximal?;Cockayne;J. Combin. Math. Combin. Comput.,1997
5. Sensitivity of the upper irredundance number to edge addition;Dunbar;J. Combin. Math. Combin. Comput.,2000