 Gary Chartrand, Daniel Johnston and Ping Zhang, "On Color Frames of Claws in Graphs", pp. 1331
 I. Beaton, S. Finbow and J.A. MacDonald, "Eternal Domination Numbers of 4 x n Grid Graphs", pp. 3348
 Jing Huang and Gary MacGillivray, "Homomorphically full reflexive graphs and digraphs", pp. 4964
 Laurent Beaudou, Roland Grappe and Gena Hahn, "Gathering information in a graph", pp. 6578
 William F. Klostermeyer, "An Eternal Vertex Cover Problem", pp. 7995
 Wayne Goddard and Kirsti Wash, "ID Codes in Cartesian Products of Cliques", pp. 97106
 S. Ao, G. MacGillivray and J. Simmons, "Hamiltonian Properties of Independent Domination Critical Graphs", pp. 107128
 Jason T. Hedetniemi, Sandra M. Hedetniemi and Stephen T. Hedetniemi, "Perfection in Graphs, A New Look at Irredundance", pp. 129139
 Michel Boyer, Sif El Harti, Amal El Ouarari, Robert Ganian, Tomas Gavenciak, Gena Hahn, Carsten Moldenauer, Ignaz Rutter, Benoit Theriault and Martin Vatshelle, "Copsandrobbers: remarks and problems", pp. 141159
 Debra L. Boutin, "The Cost of 2Distinguishing Selected Kneser Graphs and Hypercubes", pp. 161171
 Wendy Myrvold and Patrick W. Fowler, "Fast Enumeration of All Independent Sets of a Graph Up To Isomorphism", pp. 173194
 M. Schurch, "Edge Colourings and the Depression of a Graph", pp. 195212
 Richard J. Nowakowski, Gabriel Renault, Emily Lamoureux, Stephanie Mellon and Timothy Miller, "The Game of timber!", pp. 213225
 Jing Huang, "Characterizing Homogenous Digraphs", pp. 227236
 Elizabeth Marie Still and Teresa W. Haynes, "Global Domination Stable Trees", pp. 237252
 Shaun M. Fallat and Shahla Nasserasr, "On the Null Space Structure Associated with Trees and Cycles", pp. 253272
 Ortrud R. Oellermann, "On Domination and Digital Convexity Parameters", pp. 273285
 Arthur S. Finbow, Bert L. Hartnell and Michael D. Plummer, "On WellCovered Quadrangulations", pp. 287297
 C.J. Hodgins and K. Seyffarth, "Distinguishing Chromatic Numbers of Wreath Products", pp. 299319
 A.P. Burger, A.P. de Villiers and J.H. van Vuuren, "Two Algorithms for Secure Graph Domination", pp. 321339
 Dennis D.A. Epple, "A new proof of a characterization of (k,l)colourable chordal graphs", pp. 341344
 Gerd Fricke, Timothy J. O'Brien, W. Christopher Schroeder and Stephen T. Hedetniemi, "A new lower bound for the irredundance number of a tree", pp. 345352
 Izak Broere and Johannes Heidema, "Inducedhereditary graph properties, homogeneity, extensibility and universality", pp. 353363
 Johannes H. Hattingh, Ossama A. Saleh, Lucas C. Van der Merwe and Terry J. Walters, "NordhausGaddum type results for the induced path number with relative complements in K_{m,n}", pp. 365377
