University of Stirling, 3-7 July 1995

- V. Abatangelo,
*Caps in PG(3,5)* - M. Abbas,
*Two new classes of Berge perfect graphs* - F. Aguilo Gost,
*Triple loop networks with small transmission delay* - M. Aider,
*Interval distance monotone graphs* - M. Alabdullatif,
*Extremal critically Hamiltonian graphs* - I. Anderson,
*Anstice and Kirkman* - K. Ando,
*On vertex diameter 2-critical graphs* - C. Balbuena,
*Extraconnectivity of graphs with large minimum degree and girth* - J. Bang-Jensen,
*A classification of locally semicomplete digraphs* - O. I. Barr,
*Partial results on extremal graphs containing all trees on k edges* - B. Bauslaugh,
*Compact Digraphs* - D. Bedford,
*Quasiorthogonal latin squares* - T. D. Bending,
*Bent functions and Kerdock codes* - M. T. Berezina,
*The latin squares connected with the finite plane of order eleven* - N. L. Biggs,
*Infinite lattice graphs and their spectra* - S. R. Blackburn,
*A generalisation of difference sets* - O. V. Borodin,
*Variable degeneracy: extensions of Brooks' and Gallai's theorems* - A. Bowler,
*Orthomorphisms of non-abelian groups* - S. Brandt,
*An extremal result for subgraphs with few edges* - R. C. Brewster,
*The complexity of mapping to edge-coloured cycles* - G. R. Brightwell,
*Random walks and electrical resistances in products of graphs* - H. J. Broersma,
*Dirac's minimum degree condition restricted to claws* - P. J. Cameron,
*On the probability of connectedness* - A. Carmona,
*On equality of connectivities and minimum degree of a digraph* - G. J. Chang,
*Embedding problems on graphs and digraphs* - W. W. Chernoff,
*Interwoven polygonal frames* - P. E. Chigbu,
*Enumeration of semi-latin squares* - E. J. Cockayne,
*Irredundance and maximum degree in graphs* - R. J. Cook,
*Node fault tolerance in complementary graphs* - P. Cowling,
*Uniqueness of the total graph for linear hypergraphs* - D. Cvetkovic,
*Canonical star bases of a graph* - U. Dempwolff,
*On a problem of T. G. Ostrom* - T. Denley,
*Some progress on the size of a 2-intersecting set system* - J. W. DiPaola,
*Trades in Steiner triple systems* - G. S. Domke,
*Fractional bondage and fractional reinforcement in graphs* - J. E. Dunbar,
*induced clique domination in graphs* - G. L. Ebert,
*Regulus-free spreads of PG(3,q)* - K. J. Edwards,
*Harmonious colourings of bounded degree graphs* - C. A. Eschenbach,
*Ambiguous entries of qualitative matrix products* - J. Fabrega,
*Fault tolerant routings in double fixed-step networks* - J. D. Parley,
*Perfect sequences of chain-complete posets* - M. A. Fiol,
*The alternating polynomials and their relation with the spectra and conditional diameters of graphs* - W. L. Fouché,
*Symmetry and Ramsey properties of posets* - M. Frick,
*Uniquely (m,k)-colourable graphs and k-saturated graphs* - D. Froncek,
*Halving unhalvable graphs* - S. Goodall,
*Trees in Dirac graphs* - D. A. Grable,
*Random methods in design theory* - P. J. Grant-Ross,
*Elements of the autotopism group of a quasigroup* - T. S. Griggs,
*The Rev. T. P. Kirkman and his work on Combinatorial Mathematics* - H. Gropp,
*Hamiltonian graphs from Kirkman to Konig* - Y. Guo,
*Path-connectivity in local tournaments* - G. Gutin,
*Hamiltonian cycles avoiding prescribed arcs in tournaments* - W. H. Haemers,
*Eigenvalues of distance-regular graphs with diameter 3* - R. Häggkvist,
*Completing partial latin squares* - F. Harary,
*The mod number of a modsum graph* - D. Hare,
*Arithmetic progressions in sequences with bounded gaps* - J. H. Hattingh,
*On weakly-connected domination in graphs* - M. A. Henning,
*Opinion functions on trees* - A. J. W. Hilton,
*Triangle decompositions of tripartite graphs, and completing pairs of ...* - S. G. Hoggar,
*KM codes: combinatorics versus algebra* - G. H. Hurlbert,
*On perfect factors and de Bruijn tori* - W. Jackson,
*Hamilton cycles in regular graphs* - D. Jennings,
*An extension for residue difference sets* - G. Jin,
*Triangle-free graphs with high minimum degree* - R. Johansson,
*Bipartite subgraphs in Dirac graphs* - T. Jordan,
*Adding and reversing arcs in semicomplete digraphs* - L. K. Jørgensen,
*Vertex-transitive graphs with small diameter* - A. D. Keedwell,
*Critical sets in latin squares: especially the elementary abelian 2-group* - A. Khelladi,
*The fibred product of graphs* - G. B. Khosrovshahi,
*On the structure of higher incidence matrices* - S. Klavzar,
*Graphs that are k-locally a hypercube* - M. Klin,
*New strongly regular graphs derived from 7-pt combinatorial configurations* - K. M. Koh,
*The number of kings in a multipartite tournament* - G. Korchmaros,
*Cyclic k-arcs in PG(2,q)* - E. Kubicka,
*Path-pairable property for grids* - G. Kubicki,
*Graph similarity and distance in graphs* - J. Kyppö,
*Multinomial formula and the arithmetical tetrahedron* - C. F. Laywine,
*The failure of the Euler conjecture for order 6 and dimensions d > 2* - F. Lazebnik,
*Graphs of prescribed girth and bi-degree* - C. Lenart,
*Polynomial invariants of set systems* - W. S. Leng,
*Complete first-order morphic calculus* - P. A. Leonard,
*Some new Z-cyclic whist tournaments* - R. P. Lewis,
*The rank of partitions modulo 2* - Y. S. Liaw,
*Construction of referee squares* - E. K. Lloyd,
*The reaction graph of the Fano plane* - P.-H. Lundow,
*A transfer matrix method for counting 1-factors* - M. S. Maamra,
*Two new classes of Berge perfect graphs* - G. MacGillivray,
*Restricted H-colourings* - E. S. Mahmoodian,
*Defining sets in vertex coloring of graphs* - L. Markus,
*Gallai-type theorems and domination parameters* - N. Martin,
*Complete bipartite factorisations of complete bipartite graphs* - W. J. Martin,
*Completely regular codes and simple subsets* - C. McDiarmid,
*Hypergraph colouring and the Lovasz local lemma* - S. McGuinness,
*Removable cycles in 2-connected graphs* - E. Mendelsohn,
*Ubiquitous configurations in Steiner triple systems* - J. M. O. Mitchell,
*Some cubic distance transitive graphs* - M. Mitjana,
*Broadcasting in some vertex symmetric graphs* - J. W. Moon,
*On the number of induced subgraphs of trees* - H. M. Mulder,
*The majority strategy for medians* - J. P. Murphy,
*Twin Steiner triple systems* - M. Muzychuk,
*On Ádám's conjecture for circulant graphs* - C. M. Mynhardt,
*Domination and irredundance in cubic graphs* - C. St. J. A. Nash-Williams,
*Connected detachments of infinite graphs* - S. D. Noble,
*Evaluating the Tutte polynomial for graphs of bounded tree width* - P. R. J. Östergård,
*On sliding block puzzles* - R. Ouafi,
*Capture-recapture methods for analysis of incomplete contingency tables* - P. J. Owens,
*Aspects of complete sets of 9x9 POLS* - K. G. Paterson,
*Single-track Gray codes* - S. Perkins,
*Mixed disparity codes* - J. Pettitt,
*Kempe chains and total colourings* - K. Pickavance,
*New aspects of KM codes* - M. D. Plummer,
*Maximum and minimum toughness of graphs of small genus* - D. A. Preece,
*Some 6x11 Youden squares and double Youden rectangles* - L. M. Pretorius,
*Partitions of countable posets* - R. C. Read,
*Combinatorial Problems in the Theory of Music* - M. J. de Resmini,
*On small sets of even type* - E. Rivera-Campo,
*Euler tours and a game of dominoes* - Y. A. Roditty,
*On the k-domination number of a graph* - G. Russell,
*Walk generating functions for generalised crystal lattices* - G. Sabidussi,
*Near similarity of pseudosimilar edges* - G. Sáez,
*Weighted threshold secret sharing schemes* - D. P. Sanders,
*Cyclic colorings of plane graphs* - A. Schaffrath,
*Some triangle-graph Ramsey numbers for connected graphs of order 7* - H. Schellwat,
*Combinatorial aspects of control* - U. Schelten,
*Small cycles in hamiltonian graphs* - I. Schiermeyer,
*Forbidden subgraphs and pancyclicity* - B. S. W. Schröder,
*On CC-comparability invariance of the fixed point property* - I. Sciriha,
*On the construction of graphs of nullity one* - K. Seyffarth,
*Broadcasting in planar graphs* - R. Shaw,
*The coloured icosahedron yields cubic sets in PG(5,2) of hyperbolic & elliptic types* - H. Siemon,
*Piotrowski's infinite series of Steiner Quadruple Systems revisited* - S. K. Simic,
*Some results on graphs whose second largest eigenvalue is very small* - P. A. Sinclair,
*The construction and reduction of strong snarks* - D. H. Smith,
*Bounds for the frequency assignment problem* - L. H. Soicher,
*Computing with graphs, groups and geometries* - B. R. Stonebridge,
*Efficient enumeration of sequences from a multiset* - C. J. Swanepoel,
*Factor-complement partitions of ascending k-parameter words* - K. J. Swanepoel,
*Spherical partitions of sets in metric spaces* - P. Szikiai,
*On a class of complete arcs in PG(n,q)* - A. G. Thomason,
*Graph products and monochromatic multiplicities* - H. Trommel,
*D_lambda-cycles and long cycles in graphs with large degrees* - W. T. Trotter,
*Balancing pairs and the cross product inequality* - M. Tsuchiya,
*On upper bound graphs whose complements are also upper bound graphs* - K. Ushio,
*S_k-factorization of complete bipartite symmetric digraphs* - V. Ustimenko,
*Lie geometries and metric association schemes of Lie type in terms of linear equations* - A. Valette,
*An application of Ramanujan graphs to C*-algebra tensor products* - H. Van der Hoist,
*On the invariance of C. de Verdière's graph parameter under clique sums* - H. J. Veidman,
*Hamilton cycles in nearly claw-free graphs* - B. J. Vowden,
*Some new infinite series of balanced superimpositions of Youden squares* - W. D. Wallis,
*Kirkman's school projects* - J. L. Walters,
*Distance irredundance in graphs: complexity issues* - H. N. Ward,
*Divisible codes* - J. J. Watkins,
*Knight's tours on a torus* - B. S. Webb,
*Orbits of infinite block designs* - C. Whitehead,
*On k-packings of Graphs* - S. Williams,
*Strongly 2-perfect cycle systems and their quasigroups* - R. J. Wilson,
- J. M. Wojciechowski,
*A criterion for the existence of transversals of set systems* - A. J. Woldar,
*New families of dense graphs of large girth* - D. R. Woodall,
*A majoritarian monotonic single-seat preferential election rule* - A. Yeo,
*Cycles in semicomplete multipartite digraphs* - N. Zagaglia Salvi ,
*New characterizations of the Petersen graph* - J. Zerovnik,
*Recognizing Cartesian graph bundles* - J. Zuther,
*Ends in digraphs*

Back to the British Combinatorial Conferences page.