5th British Combinatorial Conference
University of Aberdeen, 14-18 July 1975
Contributed talks:
- H. L. Abbott,
On a conjecture of Erdős and Straus on non-averaging set of
integers
- P. Avery,
Semiorders and representable graphs
- D. W. T. Bean and J. Sheehan,
Graphs with given girth and diameter
- L. W. Beineke and A. J. Schwenk,
On a bipartite form of the Ramsey theorem
- H. Beker,
An orbit theorem for designs
- J. C. Bermond,
On Hamiltonian walks
- J. C. Bermond and D. Sotteau,
Graph decompositions and G-designs
- N. L. Biggs and G. H. J. Meredith,
A theorem on planar partitions
- B. Bollobás,
Relations between sets of complete subgraphs
- J. A. Bond and M. D. Plummer,
Separating cycles in graphs
- F. Bories and J.-L. Jolivet,
The achromatic number of a hypergraph
- C. C. Chen. D. E. Daykin and P. Erdős,
Subgraphs with all colours in a line-coloured graph
- D. V. Chopra,
On the maximum number of constraints for some orthogonal arrays of
strength four
- C. R. J. Clapham,
Piecing together paths in self-complementary graphs
- E. J. Cockayne and B. L. Hartnell,
Edge Partitions of complete multipartite graphs into equal length
circuits - a summary
- D. A. Drake,
The existence problem for finite Hjelmslev planes
- F. D. J. Dunstan,
Sequential colourings of graphs
- C. S. Edwards,
Triangles in simple graphs and some related results
- S. E. Eldridge and B. Bollobás,
Maximal matchings in graphs with given maximal and minimal
degrees
- S. Fiorini and R. J. Wilson,
Edge-colourings of graphs - some applications
- R. Fournier,
Irreducible subdirect representations of graphs
- A. Frank,
Some polynomial algorithms for certain graphs and hypergraphs
- A. Gardiner,
Partitions in graphs
- M. Gordon and C. G. Leonis,
Combinatorial short-cuts to statistical weights and enumeration of
chemical isomers
- D. D. Grant,
How to run a hockey tournament - a combinatorial scheduling
problem
- C. D. Green,
The detection of mistakes in the comparability graph of a tree
- P. Hammond and D. H. Smith,
An analogue of Lloyd's theorem for completely regular codes
- R. Halin,
On chainlike decompositions of graphs
- P. Hell and D. J. Miller,
On forbidden quotients and the achromatic number
- A. Hill and D. Singmaster,
Labelled and unlabelled Hamiltonian circuits in a class of
3-polytopes
- A. J. W. Hilton,
The cover index, the chromatic index and the minimum degree of a
graphs
- S. G. Hoggar,
New equi-isoclinic n-planes from old
- D. A. Holton,
The König question
- J. P. Hutchinson,
On coloring maps made from Eulerian graphs
- A. W. Ingleton,
Non-base-orderable matroids
- D. M. Jackson,
Formal enumerative methods for the homeomorphically irreducible
labelled graph problem, and the generalized Simon Newcomb and Smirnov
problems
- F. Jaeger,
On nowhere-zero flows in multigraphs
- R. P. Jones,
Brooks' theorem for hypergraphs
- A. D. Keedwell,
Recent results concerning complete latin squares
- M. Las Vergnas,
On certain constructions for matroids
- H. Liebeck,
Digraphs and the construction of groups with specified automorphism
group
- E. K. Lloyd,
Facts and myths in the history of graph theory
- L. Lovász and M. Simonovits,
On the number of complete subgraphs of a graph
- J. Malkevitch,
Polytopes with a constant face vector
- S. B. Maurer,
Cycle-complete graphs
- C. McDiarmid,
On separated separating sets and Menger's theorem
- A. Meir and J. W. Moon,
Climbing certain types of rooted trees I
- E. C. Milner and D. J. A. Welsh,
On the computational complexity of graph theoretical
properties
- H. D. Patterson and E. R. Williams,
Some theoretical results on general block designs
- J. L. Paul,
On the partitioning of sets of lattice point paths
- W. R. Pulleyblank,
Convex decomposition of graphs
- A. Recski,
On the sum of matroids II
- P. Rosenstiehl,
Caracterisation des graphes planaires par une diagonale
abstraite
- H. Sachs,
On the number of spanning trees
- J. Schönheim,
Hereditary systems and Chvátal's conjecture
- L. Schrijver,
Linking systems, matroids and bipartite graphs
- P. D. Seymour,
The max-flow min-cut property in matroids
- D. Singmaster and A. Hill,
Some classes of Hamiltonian 3-polytopes
- P. J. Slater,
Generalized soldering
- R. G. Stanton, W. L. Kocay and P. H. Dirksen,
Computation of a combinatorial function
- F. Sterboul,
Some extremal coloring problems: a survey
- H. N. V. Temperley,
Transformation of graph-theoretical problems into one another
- G. P. Thomas,
Introducing Baxter sequences
- D. A. Waller,
Pullbacks in the category of graphs
- P. J. Wilde,
A partial ordering for matroids
- R. Weiss,
Tutte's cages
- D. R. Woodall,
The inequality b \ge v
Back to the British Combinatorial
Conferences
page.