British Combinatorial Conference
University College of Wales, Aberystwyth,
2-6 July 1973
Contributed talks:
- N. Biggs,
Perfect codes and distance-transitive graphs
- P. J. Cameron,
Generalisation of Fisher's inequality to fields with more than one
element
- D. V. Chopra,
On balanced arrays
- R. L. Constable,
Positions in room squares
- R. J. Cook,
Analogues of Heawood's theorem
- D. E. Daykin,
Sperner-type theorems for finite sets
- F. Escalante,
Cut-set lattices of graphs
- S. Fiorini and R. J. Wilson,
On the chromatic index of a graph, II
- A. Gardiner,
On a theorem of R. A. Liebler
- R. K. Guy,
Outerthickness and outercoarseness of graphs
- A. Hill,
Graphs with homeomorphically irreducible spanning trees
- A. J. W. Hilton,
A note on embedding latin rectangles
- P. N. Hoffman,
On graph embeddings
- D. A. Holton,
Some results in semi-stable graphs
- R. P. Jones,
Hereditary properties and P-chromatic numbers
- A. D. Keedwell,
Some problems concerning complete latin squares
- E. K. Lloyd,
Necklace enumeration with adjacency restrictions
- L. Lovasz and M. D. Plummer,
On a family of planar bicritical graphs
- C. J. H. McDiarmid,
Matroids arising from path partitions
- J. C. P. Miller,
On the enumeration of partially ordered sets of integers
- J. W. Moon,
The distance between nodes in recursive trees
- R. Nelson,
Partition relations
- D. A. Preece,
Non-orthogonal Graeco-Latin designs
- J. Schonheim,
On a problem of Daykin concerning intersecting families of
sets
- J. Sheehan,
Unstable trees
- D. H. Smith,
Distance-transitive graphs
- H. N. V. Temperley,
Enumeration of graphs on a large periodic lattice
- W. T. Tutte,
Some polynomials associated with graphs
- J. H. van Lint,
Equidistant point sets
- D. A. Waller,
Eigenvalues of graphs and operations
- R. J. Wilson,
Graph theory and algebraic topology
- D. R. Woodall,
Applications of polymatroids and linear programming to transversals
and graphs
Back to the British Combinatorial
Conferences
page.