8th British Combinatorial Conference
University College, Swansea, 20-24 July, 1981
Contributed talks:
- Ian Anderson,
Skolem triples and toroidal thickness
- Jaakko Astola,
On bounds for Lee-codes
- F. W. Barnes,
Barring rectangles and polyominoes from the plane
- G. Baron,
Finite operator calculus on free monoids
- L. M. Batten,
Jordan-Dedekind spaces
- N. L. Biggs,
Some unbounded excesses
- L. J. Cummings,
On the construction of Thue strings
- William H. Cunningham,
Decomposition of directed graphs
- C. D. Godsil,
Matchings in graphs and orthogonal polynomials
- M. J. Grannell (speaker) and T. S. Griggs,
Product constructions for cyclic Steiner systems
- C. W. Haigh,
Variations in a theme of Waller: further excursions in musical
graph theory
- C. W. Haigh and M. Randic,
Common eigenvalues of graphs
- C. W. Haigh,
More results on distance-degree-regular graphs
- C. W. Haigh,
Cospectral graphs obtained by Seidel-switching
- C. W. Haigh, J. W. Kennedy and L. V. Quintas,
Enumeration, by diameter, of trees whose automorphism group is a
symmetric group, and whose vertex degrees do not exceed a fixed
value
- Jonathan I. Hall,
Standard form for geometries and graphs
- Frank Harary,
Achievement and avoidance games from three theorems
- R. Hill,
Towards an optimum telephone directory
- A. J. W. Hilton,
Balanced edge-colourings
- S. G. Hoggar,
Bounds and combinatorial properties for Delsarte spaces
- D. F. Hsu,
Cyclic neofields and Mendelsohn block designs
- Joan P. Hutchinson (speaker) and Ellen Gethner,
Edge-transitive platonic graphs on the torus
- W. Jackson,
Long cycles in 2-connected bipartite graphs
- A. D. Keedwell,
On R-sequenceability and R_h-sequenceability of groups
- A. K. Kelmans,
On D-optimal hypergraphs
- B. Kestenband,
Correlation-induced configurations in finite geometries
- E. Keith Lloyd,
The first (known) book in English on combinatorial analysis
- P. Kirschenhofer,
Binomial systems, Lagrange inversion and Sheffer systems on free
monoids
- R. B. Mallion,
Counting the spanning trees of a molecular graph
- Brendan D. McKay,
Spanning trees in regular graphs
- A. W. Meir and J. W. Moon,
Terminal path numbers for certain families of trees
- P. J. Owens,
Some results on non-hamiltonian planar graphs
- C. K. Bailey, J. W. Kennedy and E. M. Palmer,
Points by degree and orbit size in chemical trees, II
- N. E. Pegg,
The generalized Clifford algebra and the Potts model
- John Shawe-Taylor and Tomaz Pisanski,
Cycle permutation graphs with large girth
- Jacek Rajkow-Krzywicki,
On tree hypergraphs
- D. F. Robinson,
The description of rectanguloid curves
- D. H. Smith,
Graphs with the minimum number of vertex cut sets
- H. N. V. Temperley,
New methods of graph enumeration on periodic lattices
- W. D. Hoskins and R. S. D. Thomas,
Compound isonemality of binary arrays
- William T. Trotter,
Combinatorial extremal problems for graphs and partially ordered
sets
- V. Neumann-Lara and J. Urrutia,
Descyclable partitions of an oriented graph I
- C. W. Vout,
A basis for evaluating rank polynomials/Potts functions using ideas
from Young tableaux
- Zsolt Tuza,
A method for solving some extremal problems
- Thomas Zaslavsky,
Is there a theory of signed graph embedding?
- ???,
Nested transversals
Back to the British Combinatorial
Conferences
page.