Geodesic

Issue 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

Issue no. 2 Table of Contents

GEMS 2009
GEMS 2009 Pictures
A new construction of antipodal distance regular covers of complete graphs through the use of Godsil-Hensel matrices
p. 205-243
On local properties of 1-planar graphs with high minimum degree
p. 245-254
Facial parity edge colouring
p. 255-269
The symmetric genus spectrum of finite groups
p. 271-289
Wada dessins associated with finite projective spaces and Frobenius compatibility
p. 291-311
Classification and Galois conjugacy of Hamming maps
p. 313-328
Decomposition of skew-morphisms of cyclic groups
p. 329-349
Enumeration of genus-four maps by number of edges
p. 351-361
Vertex transitive maps on the Klein bottle
p. 363-374
Small vertex-transitive graphs of given degree and girth
p. 375-384
Edge-transitive maps of low genus
p. 385-402
Conference and MAGMA Workshop "Symmetries of discrete objects"
Computers in Scientific Discovery 6