Table of Contents
Editorial
| In memory of Michael O. Albertson, 1946–2009 | |
| Joan P. Hutchinson |
Articles
| Disjoint homometric sets in graphs | |
| Michael O. Albertson, Janos Pach, Michael E. Young |
| More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number | |
| Michael O. Albertson, Debra L. Boutin, Ellen Gethner |
| Graphs with chromatic numbers strictly less than their colouring numbers | |
| Xuding Zhu |
| How to lose as little as possible | |
| Vittorio Addona, Stan Wagon, Herb Wilf |
| Motion and distinguishing number two | |
| Marston Conder, Thomas Tucker |
| A new proof of 3-colorability of Eulerian triangulations | |
| Mu-Tsun Tsai, Douglas B. West |
| On 2-factors with long cycles in cubic graphs | |
| André Kündgen, R. Bruce Richter |
| The total weak discrepancy of a partially ordered set | |
| Alan Shuchat, Randy Shull, Ann N. Trenk |
| Distinguishing partitions and asymmetric uniform hypergraphs | |
| M. N. Ellingham, Justin Z. Schroeder |
| Gray code numbers for graphs | |
| Kelly Choo, Gary MacGillivray |
| Natural realizations of sparsity matroids | |
| Ileana Streinu, Louis Theran |
| Graphs with maximum degree 5 are acyclically 7-colorable | |
| Alexandr V. Kostochka, Christopher J. Stocker |
| 3-Connected planar graphs are 5-distinguishing colorable with two exceptions | |
| Gašper Fijavž, Seiya Negami, Terukazu Sano |
| Dominating sets in triangulations on surfaces | |
| Hong Liu, Michael J. Pelsmajer |
ISSN: 1855-3974