Geodesic

Volume 4 (2011) no. 1

Table of contents

In memory of Michael O. Albertson, 1946–2009
Disjoint homometric sets in graphs
p. 1-4
More results on r-inflated graphs: Arboricity, thickness, chromatic number and fractional chromatic number
p. 5-24
Graphs with chromatic numbers strictly less than their colouring numbers
p. 25-27
How to lose as little as possible
p. 29-62
Motion and distinguishing number two
p. 63-72
A new proof of 3-colorability of Eulerian triangulations
p. 73-77
On 2-factors with long cycles in cubic graphs
p. 79-93
The total weak discrepancy of a partially ordered set
p. 95-109
Distinguishing partitions and asymmetric uniform hypergraphs
p. 111-123
Gray code numbers for graphs
p. 125-139
Natural realizations of sparsity matroids
p. 141-151
Graphs with maximum degree 5 are acyclically 7-colorable
p. 153-164
3-Connected planar graphs are 5-distinguishing colorable with two exceptions
p. 165-175
Dominating sets in triangulations on surfaces
p. 177-204