Vol 4, No 1 (2011)

DOI: https://doi.org/10.26493/1855-3974.4_1

Table of Contents

Editorial

In memory of Michael O. Albertson, 1946–2009
Joan P. Hutchinson
PDF

Articles

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