| 297 | -- | 308 | R. Julian R. Abel, Frank E. Bennett. Super-Simple Twofold Steiner Pentagon Systems |
| 309 | -- | 314 | Ni Cao, Han Ren. Exponentially Many Monochromatic n-Matchings in K 3n-1 |
| 315 | -- | 332 | Ermelinda DeLaViña, Craig E. Larson, Ryan Pepper, Bill Waller. A Characterization of Graphs Where the Independence Number Equals the Radius |
| 333 | -- | 345 | Mitre Costa Dourado, Fábio Protti, Dieter Rautenbach, Jayme Luiz Szwarcfiter. On the Convexity Number of Graphs |
| 347 | -- | 364 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan. Finding a Sun in Building-Free Graphs |
| 365 | -- | 380 | Ruy Fabila Monroy, David Flores-Peñaloza, Clemens Huemer, Ferran Hurtado, Jorge Urrutia, David R. Wood. Token Graphs |
| 381 | -- | 392 | S. Aparna Lakshmanan, Csilla Bujtás, Zsolt Tuza. Small Edge Sets Meeting all Triangles of a Graph |
| 393 | -- | 406 | Lili Zhang, Yehong Shao, Guihai Chen, Xinping Xu, Ju Zhou. s-Vertex Pancyclic Index |
| 407 | -- | 421 | Christian Löwenstein, Dieter Rautenbach. Pairs of Disjoint Dominating Sets in Connected Cubic Graphs |
| 423 | -- | 432 | Tran Dan Thu. On Half-Way AZ-Style Identities |
| 433 | -- | 448 | Zan-Bo Zhang, Xiaoyan Zhang, Dingjun Lou, Xuelian Wen. Minimum Size of n-Factor-Critical Graphs and k-Extendable Graphs |