Contents

pp iii-iv

Preface

pp v-vi

Papers contributed by the participants

Perfect codes and distance-transitive graphs

pp 1-8

Generalisation of Fisher's inequality to fields with more than one element

pp 9-14

On balanced arrays

pp 15-22

Positions in Room squares

pp 23-26

Analogues of Heawood's theorem

pp 27-34

Cut-set lattices of graphs

pp 35-36

On the chromatic index of a graph, II.

pp 37-52

On a theorem of R. A. Liebler

pp 53-56

Outerthickness and outercoarseness of graphs

pp 57-60

Graphs with homeomorphically irreducible spanning trees

pp 61-68

A note on embedding latin rectangles

pp 69-74

Some results in semi-stable graphs

pp 75-82

Hereditary properties and P-chromatic numbers

pp 83-88

Some problems concerning complete latin squares

pp 89-96

Necklace enumeration with adjacency restrictions

pp 97-102

On a family of planar bicritical graphs

pp 103-108

On the enumeration of partially ordered sets of integers

pp 109-124

The distance between nodes in recursive trees

pp 125-132

Partition relations

pp 133-138

On a problem of Daykin concerning intersecting families of sets

pp 139-140

Unstable trees

pp 141-144

Distance-transitive graphs

pp 145-154

Enumeration of graphs on a large periodic lattice

pp 155-160

Some polynomials associated with graphs

pp 161-168

Equidistant point sets

pp 169-176

Eigenvalues of graphs and operations

pp 177-184