| 0 | -- | 0 | Joan P. Hutchinson. In memory of Michael O. Albertson, 1946-2009 |
| 1 | -- | 4 | Michael O. Albertson, János Pach, Michael E. Young. Disjoint homometric sets in graphs |
| 5 | -- | 24 | Michael O. Albertson, Debra L. Boutin, Ellen Gethner. More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number |
| 25 | -- | 27 | Xuding Zhu. Graphs with chromatic numbers strictly less than their colouring numbers |
| 29 | -- | 62 | Vittorio Addona, Stan Wagon, Herbert S. Wilf. How to lose as little as possible |
| 63 | -- | 72 | Marston D. E. Conder, Thomas W. Tucker. Motion and distinguishing number two |
| 73 | -- | 77 | Mu-Tsun Tsai, Douglas B. West. A new proof of 3-colorability of Eulerian triangulations |
| 79 | -- | 93 | André Kündgen, R. Bruce Richter. On 2-factors with long cycles in cubic graphs |
| 95 | -- | 109 | Alan Shuchat, Randy Shull, Ann N. Trenk. The total weak discrepancy of a partially ordered set |
| 111 | -- | 123 | Mark N. Ellingham, Justin Z. Schroeder. Distinguishing partitions and asymmetric uniform hypergraphs |
| 125 | -- | 139 | Kelly Choo, Gary MacGillivray. Gray code numbers for graphs |
| 141 | -- | 151 | Ileana Streinu, Louis Theran. Natural realizations of sparsity matroids |
| 153 | -- | 164 | Alexandr V. Kostochka, Christopher J. Stocker. Graphs with maximum degree 5 are acyclically 7-colorable |
| 165 | -- | 175 | Gasper Fijavz, Seiya Negami, Terukazu Sano. 3-Connected planar graphs are 5-distinguishing colorable with two exceptions |
| 177 | -- | 204 | Hong Liu, Michael J. Pelsmajer. Dominating sets in triangulations on surfaces |