University of East Anglia, Norwich, 3-7 July 1989

- A. Ainouche,
*Extensions of Ore's theorem* - L. D. Andersen (speaker) and H. Fleischner,
*The NP-completeness of finding A-trails in Eulerian graphs and spanning trees in hypergraphs* - I. Anderson,
*Whist tournaments for 4n+1 players* - J. L. Andres-Yebra,
*On the existence of largest invulnerable graphs* - M. Anthony,
*Computing chromatic polynomials* - K. T. Arasu (speaker), D. Jungnickel and A. Pott,
*Visible difference sets with multiplier -1* - C. A. Baker,
*Moufang Klingenberg planes and their rings* - F. W. Barnes,
*A permutation reciprocity law* - L. Batten,
*Blocking sets with flag-transitive collineation groups* - G. Behrendt,
*Automorphism groups of posets containing no crowns* - F. K. Bell,
*On the maximal index of connected graphs* - L. J. Beresina (speaker) and M. T. Berezina,
*On a certain construction of mutually orthogonal Latin squares* - A. Bialostocki (speaker) and P. Dierker,
*On zero sum Ramsey numbers* - J. Bierbrauer,
*Some new block designs* - N. Biggs,
*Learning Algorithms* - A. Bonisoli (speaker) and G. Korchmaros,
*On sharply 3-transitive finite permutation groups* - L. Borzacchini,
*Partition patterns enumeration and reconstruction conjecture* - A. B. Bouchet (speaker) and A. Duchamp,
*A characterization of binary delta-matroids* - H. J. Broersma,
*Long dominating cycles and paths in graphs with large neighbourhood unions* - J. M. Brown,
*Partitions in Figueroa planes* - N. Calkin,
*On the number of sum-free sets of integers* - P. J. Cameron,
*Trees and 2-graphs* - G. J. Chang (speaker) and P. H. Ho,
*The \beta-assignment problem in general graphs* - W. W. Chernoff,
*Solutions to x^r=a in the alternating group* - W. E. Cherowitzo,
*A survey of the rook domain covering problem* - D. V. Chopra,
*On balanced arrays with two levels* - E. J. Cockayne (speaker) and C. M. Mynhardt,
*The irredundant Ramsey number S(3,3,3)* - F. P. Comellas (speaker), M. Fiol and P. Morillo,
*Diameter and mean distance of bipartite dig raphs* - R. T. Curtis,
*The dodecahedron and the binary Golay code* - D. Cvetkovic,
*Some possibilities of constructing graphs with given eigenvalues* - N. Dean,
*Matching extendability of surfaces* - A. Delandtsheer,
*Secant-transitive semiovals in finite projective planes* - J. W. Di Paola,
*The construction of maximal partial Steiner k-tuple systems* - M. Doob,
*On the largest eigenvalue of a graph* - O. Egecioglu (speaker) and J. B. Remmel,
*A bijective proof for the number of spanning trees of complete multipartite graphs* - S. A. Ernvall,
*On bounds for arithmetic codes* - J. Fabrega (speaker), M. Escudero and M. A. Fiol,
*Short paths and connectivity in graphs and digraphs* - P. Faudree,
*Ramsey numbers for the pair cycle-tree* - O. Favaron,
*Some relations among graph parameters* - M. A. Fiol,
*Connectivity of large graphs* - E. N. Flandrin (speaker) and H. Li,
*New sufficient conditions for Hamiltonism* - J. L. Fouquet (speaker), J. L. Jolivet and M. Riviere,
*An o(n^2) algorithm to recognize bipartite P*_{6}-free graphs - A. Gardiner,
*A class of distance-transitive graphs of diameter three* - D. Ghinelli,
*Bounds for an extended generalized quadrangle* - M. Gionfriddo (speaker), F. Milazzo and V. Vacirca,
*Transitive multi-permutation graphs* - D. Glynn,
*On inversive planes of even order* - F. Göbel,
*Colouring a graph optimally with two colours* - J. Gomez (speaker) and M. A. Fiol,
*Generalized compound graphs* - I. P. Goulden,
*The number of permutations with a long increasing subsequence* - H. Gropp,
*Configurations and the Tufle conjecture* - T. Gustavsson,
*Finding a triangle decomposition of a large graph with high minimum degree* - A. Gyarfas,
*Strong chromatic index of graphs* - W. H. Haemers,
*Extensions of partial geometries and regular 2-graphs* - M. Hall Jr,
*Matrices and Designs Unitals as codewords* - H. Harborth,
*Some mosaic polyominoes* - D. R. Hare,
*Sparse colour-critical hypergraphs with no short cycles* - A. Hartman,
*Greedy-designs* - E. R. Harzheim,
*A reconstruction problem for linearly ordered sets* - T. B. Hellgren (speaker) and R. Häggkvist,
*Extensions of edge colourings in hypergraphs* - S. N. Henson,
*On the numbers of connected induced subgraphs* - A. J. Hilton,
*The connection between an edge-colouring and a total colouring conjecture* - J. W. Hirschfeld,
*Subsets of finite planes* - S. A. Hobart,
*An inequality for t-designs* - C. Hoede,
*On Strong Double Cycle Covers* - S. G. Hoggar,
*Jacobi polynomials and intersection numbers* - D. Holton,
*Cycles in Graphs* - I. S. Honkala,
*Bounds for q-ary covering codes* - A. L. Iva'nyi (speaker) and A. Iva'nyi,
*Construction of three-dimensional de Bruijn matrices* - W.-A. Jackson,
*Sharply and very sharply focussed sets in PG(2,q)* - Y. S. Jacobson,
*On n-irredundance and n-domination* - V. Jha,
*Binary codes associated with translation planes* - K. Jones (speaker), C. A. Anderson and J. R. Lundgren,
*Competition graphs and multigraphs* - L. K. Jørgensen,
*Coverings of infinite graphs* - O. D. Kang,
*A generalization of the Mendelsohn triple systems* - A. K. Karabeg,
*P0-trees and tn-connectivity* - R. Kaya,
*On the line classes of some finite planes* - A. D. Keedwell,
*On proper loops of order n in which each non-identity element has left-order n.* - A. Khelladi,
*Bi-directed graphs: flows and classification* - G. B. Khosrovshahi (speaker) and F. Vatan,
*On 4-(1O,5,6m) designs with repeated blocks* - G. Kiss,
*Reflections on finite planes* - I. Krasikov (speaker), Y. Caro and Y. Roditty,
*Subtrees in a connected graph* - E. R. Lamken,
*Some new results for DR(v,k,k-1)-BIBDS* - H. Laue,
*On the associative expansion of a Lie word* - H. Lefmann,
*On quantitative canonical partition theorems* - J. Lehel (speaker) and A. Gyárfás,
*On-line chromatic number of graphs* - H. Lenz,
*On Egmont Köhler's combinatorial work* - L. M. Lesniak,
*Which graphs are distance transitive graphs?* - H. Li (speaker) and E. Flandrin,
*Chvátal-Erdős conditions in 3-connected claw-free graphs* - J. W. Lorimer,
*A topological characterization of finite Desarguesian Hjelmslev planes* - R.-M. Madani,
*A class of minimal {O,2}-graphs: Generalized Shrikhande graphs* - R. A. Malcor,
*Chromatic number of polytopes vertices - a conjecture* - Y. Manoussakis (speaker) and W. Fernanda de la Vega,
*On the forwarding index of communication networks with given connectivity* - A. Maschietti,
*Hyperovals in planes of even order* - T. Matsui (speaker) and K. Fukuda,
*Finding all minimum cost perfect matchings in bipartite graphs* - T. C. Maund,
*Geometric groups* - H. Mäurer,
*The number of fixed subspaces of a collineation in PG(d,q)* - F. R. McMorris,
*Interval acyclic digraphs* - M. Mehbafi,
*Vehicle routing problem* - J. M. Mitchell,
*On w-divisors of a graph* - B. Mohar,
*Algebraic methods in graph theory and combinatorial optimization* - J. W. Moon (speaker) and A. Meir,
*Trees with even distances between end nodes* - H. M. Mulder,
*Three interval conditions for graphs* - C. M. Mynhardt,
*Irredundant Ramsey theory* - D. E. Newton (speaker) and R. Hill,
*Optimal ternary linear codes* - O. R. Oellermann (speaker), M. A. Henning and H. C. Swart,
*On the Steiner radius and Steiner diameter of a graph* - P. J. Owens,
*Nineteen complete sets of POL's of order 9* - Z. Palka,
*Metric properties of random graphs* - K. T. Phelps,
*Blocking sets in designs with block size 4* - M. A. Picardello,
*Eigenfunctions of the adjacency matrix of a foliated tree* - D. A. Preece,
*Fifty years of Youden squares: a review* - O. Pretzel,
*Cycle lengths determine orientability* - N. Ray,
*Colourings of set systems* - R. Read (speaker) and C. D. Wright,
*Computing with tricolourable graphs - a survey* - F. Regonati,
*Whitney numbers of the second kind of finite modular Iatbces* - M. J. de Resmini,
*On the derived semifield plane of order 16* - G. N. Robertson (speaker), P. D. Seymour and R. Thomas,
*Graph width made easier* - C. A. Rodger,
*2-perfect 6-cycle systems* - P. Rowlinson,
*Hamiltonian graphs with maximal index* - P. M. Salzberg,
*On the pattern of crosses of a pen of lines on the 2-D torus* - A. Sanchez-Arroyo,
*How strong is the perfect graph conjecture?* - I. Schiermeyer,
*Hamilton cycles based on degree-sums of independent triples and quadruples* - J. Schönheim,
*An anti-Schur theorem* - R.-H. Schulz,
*On check character systems* - J. J. Seidel,
*Optimal designs of degree e and measures of strength 2e.* - J. Sheehan,
*Edge reconstruction of bi-directed graphs* - H. Siemon,
*On the existence of cyclic Steiner quadruple systems* - M.-K. Siu,
*On arrays with small off-phase binary auto-correlation* - C. A. B. Smith,
*Complexity and tree-counting* - D. H. Smith,
*Non regular graphs of optimal reliability* - J. D. H. Smith,
*Quasigroups, association schemes and sharply transitive sets* - E. Spence,
*Is Taylor's graph geometric?* - L. P. I. Storme,
*K-arcs and hypersurfaces* - T. Szőnyi (speaker) and J. Lehel,
*Irregular weighting of finite projective planes* - H. Tecklenburg,
*Latin squares and configuration axioms in affine planes* - H. N. Temperley,
*New results on the Potts model and the self avoiding walk problem* - J. A. Thas,
*Partial flocks, new flocks, new planes, new generalized quadrangles and the complete classification of maximal exterior sets* - G. P. Thomas,
*Some results and conjectures on the use of raising operators* - V. D. Tonchev,
*Self-dual codes derived from Hadamard matrices* - W. T. Trotter,
*Graphs and partially ordered sets* - Z. Tuza,
*Coverings in graphs and hypergraphs* - J. Van Rees,
*Subdesigns and transversals in Latin squares* - H. J. Veldman,
*Hamiltonian properties of graphs with large neighbourhood unions* - C. Virlouvet,
*Minimally 4-edged-#-connected graphs* - Th. N. Vougiouklis,
*Isomorphisms on P-hypergroups and cyclicity* - M. Weichsel,
*Large subgraphs of hypercubes* - F. Wettl,
*Orthogonal packings* - R. W. Whitty,
*Strongly 4-colourable graphs* - P. R. Wild,
*Maximal (k,r)-sets of PG(3n-1,q)* - D. R. Woodall,
*Generic mobility matroids of graphs* - D. A. Youngs,
*Constructing "small" non-Hasse diagrams* - N. Zagaglia Salvi,
*On the value of the point-distinguishing chromatic index of K(n,n)* - J. Zerovnik,
*Computing the diameter of a double loop network* - P. H. Zieschang,
*Flag transitive automorphism groups of 2-designs with |\pi(F(G))|=2*

Back to the British Combinatorial Conferences page.