Chair: D. B. Penman, MS.02 
10:30  10:50 
P. J. Cameron
Remembering Donald Preece 
10:55  11:15 
K. Tyros
General stability and exactness theorems

11:20  11:40 
J. Sliacan
Flagmatic and Turán densities 
11:45  12:05 
S. Nakamura
The number of contractible edges in a 4connected graph having a small number of edges not contained in triangles 

Chair: M. Ellingham, MS.03 
10:30  10:50 
K. K. Dabrowski
Cliquewidth of restricted graph classes 
10:55  11:15 
V. Zamaraev
Wellquasiordering does not imply bounded cliquewidth 
11:20  11:40 
A. Collins
Cliquewidth, linear cliquewidth and wellquasiordering 
11:45  12:05 
M. M. Ferrari
On the partition graph of a positive integer 

Chair: K. Staden, MS.04 
10:30  10:50 
M. Bachraty
Approaching the Moore bound for diameter 3 by Cayley graphs 
10:55  11:15 
R. F. Bailey
On the metric dimension of imprimitive distanceregular graphs, II 
11:20  11:40 
G. Erskine
New constructions for large circulant graphs of given degree and diameter 
11:45  12:05 
J. B. Gauci
Diameter vulnerability of the generalized Petersen graphs 

Chair: J. W. P. Hirschfeld, B3.02 
10:30  10:50 
S. R. Blackburn
Probabilistic existence results for separable codes 
10:55  11:15 
M. B. Paterson
Characterisations of optimal algebraic manipulation detection codes 
11:20  11:40 
K. Shiromoto
On covering dimension of linear codes and matroids 
11:45  12:05 
B. S. Webb
Subsystems of Netto triple systems 
