16th British Combinatorial Conference
Queen Mary and Westfield College, London, 7-11 July, 1997

Contributed talks:

• F. Aguiló Gost, New dense families of triple loop networks
• M. Alabdullatif, On locally hamiltonian graphs and locally traceable graphs
• S. M. Allen, Lower bounding techniques for frequency assignment
• I. Anderson, On the construction of balanced Room squares
• K. Ando, Length restricted weakly 3-linked graphs
• D. Archdeacon, Two graphs on the torus
• G. Bacsó, Dominating subgraphs of a given type
• R. A. Bailey, Partially balanced semi-Latin rectangles
• C. Balbuena, Extraconnectivity of s-geodetic digraphs and graphs
• J. Barát, Hamiltonian cycles in regular graphs
• O. Barr, Erdős-Sós conjecture for graphs with high minimal degree
• L. Barrière, Fault tolerant routings in chordal ring networks
• D. Bedford, Transversals in Latin squares based on groups
• R. A. Beezer, Counting configurations in designs
• L. W. Beineke, Oriented graphs with the maximum number of 3-cycles
• F. K. Bell, The second-largest eigenvalue of star-like trees
• T. Bending, Wheels for the UK National Lottery
• A. Benhamdine, Distance-dominating cycles in quasi-claw-free graphs
• F. E. Bennett, Perfect Mendelsohn designs with block size six
• A. Betten, Plesken-rings and intersection numbers of design
• A. Betten, Construction of Designs with DISCRETA
• N. L. Biggs, Growth functions and Tutte polynomials
• E. J. Billington, Decomposing tripartite graphs into small cycles
• S. R. Blackburn, Linear perfect hash families
• S. Blake-Wilson, Constant-weight codes and group divisible designs
• A. Blokhuis, Minimal covers by lines of PG(3,q)
• A. Bonisoli, Mixed partitions of PG(r,q) involving caps
• A. Bowler. On the existence of certain directed t-designs
• L. Boza. A link between Halin's Theorem and Oubiña and Zucchello's Theorem
• S. Brandt, Expanding graphs and Ramsey numbers
• G. Brightwell, Large common subgraphs
• H. J. Broersma, Degree-preserving spanning trees in water distribution networks
• J. Cáceres, VAP-free planarity, planarity and EAP-free planarity testing of dynamic graphs
• I. Cahit, On strong magic trees
• A. Carmona, Superconnectivity of bipartite digraphs and graphs
• M. Cera, Extremal graphs without topological complete subgraphs
• G. J. Chang, The number of maximal independent sets of a connected triangle-free graph
• R. Chapman, Higher power residue codes
• M. J. Chavez, Some eulerian and hamiltonian graphs related to 2-complexes
• P. E. Chigbu, On finding the non-isomorphism classes of the (n x n)/k semi-Latin squares
• D. Cieslik, Vertex degrees of minimal spanning trees
• C. Cooper, Asymptotics for dependent sums of random vectors
• S. Corteel, A pentagonal number sieve
• C. Cortes, Toroidal embeddings of outertoroidal graphs
• B. Curtin, Spin models on distance-regular graphs
• D. Cvetkovic, Seeking counterexamples to the reconstruction conjecture for the characteristic polynomials of graphs
• P. Dankelmann, On maximally edge-connected graphs
• P. Danziger, Intercalates everywhere
• J. A. Davis, Construction of relative difference sets
• D. P. Day, Bounds on the size of graphs of given order and e-connectivity
• F. De Clerck, Some geometric properties of the recent discovered partial geometries
• J. W. Di Paola, Large families of Steiner triple systems
• L. L. Doty, Circulant graphs with maximum neighbour connectivity
• J. Dunbar, A path(ological) partition problem
• Y. Egawa, Nonseparating cycles consisting of contractible edges
• M. El Kadi Abderrezzak, New results on hamiltonicity in the square of a connected graph
• H. Enomoto, Cyclic chromatic number of 3-connected plane graphs
• S. Evdokimov, Compact cellular algebras and permutation groups
• O. Favaron, Irredundant and perfect neighborhood sets
• D. Ferrero, Disjoint paths of bounded length in large generalized cycles
• E. Fischer, Asymptotic graph embedding problems
• W. Fouché, Symmetry and Ramsey degrees of relational structures
• E. Francot, Blocking sets of type (1,k) in finite projective planes
• M. Frick, The minimum number of edges in k-critical graphs
• C.-M. Fu, 4,6,8,-cycle decomposition of K_m,n
• H.-L. Fu, Optimal packing and covering of \lambdaK_n with K₄'s
• H. Galeana-Sánchez, Cycle pancyclism in tournaments
• M. A. Garrido, Embedding a graph in the grid of a surface with the minimum number of bends is NP-hard
• M. Gegundez, A characterization of the (W, X, Y)-outerplanar graphs
• J. Gilbey, Priority queues and parking functions
• J. Gimbert, On the existence of (d,k)-digraphs
• J. A. Gongora-Aldaz, Some balanced superimpositions of four symbols on Latin squares of size six
• R. J. Gould, On 2-factors containing 1-factors in bipartite graphs
• R. A. H. Gower, Radio channel assignment for directional antennas
• H. Gropp, Infinite series of (r, 1)-designs
• G. Gutin, Alternating cycles in arc-coloured digraphs
• E. Győri, Perfect matchings in products of graphs
• W. H. Haemers, Resolvable coverings with small parallel classes
• A. M. Hamel, Schur Q-functions and pfaffians
• F. Harary, On the out-domination and in-domination numbers of a digraph
• H. Harborth, All two-color Rado numbers for a(x + y) = bz
• D. Hare, Square critically 3-chromatic hypergraphs order
• B. Hartnell, On the minimum size of a graph with given bondage number and order
• M. A. Henning, A characterisation of edge-minimal graphs on n vertices with minimum degree two and restrained domination number at least (n - 1)/2
• J. van den Heuvel, Random generation of spanning trees
• R. Hill, An improved lower bound on K₂(9, 1)
• A. J. W. Hilton, Hamiltonian latin squares
• H. van der Holst, A characterization of the graphs G with \nu(G) \le k for k = 2,3
• S. Houghten, The search for a (46,6,1) block design
• K.-C. Huang, On the linear-k-arboricity
• A. Hulpke, Galois groups through invariant relations
• A. Hulpke, GAP
• C.. Huybrechts, (L.L*)-geometries and D_n-buildings
• B. Jackson, A matroid analogue of Dirac's theorem on long circuits
• S. Jendrol', Light subgraphs in planar graphs
• P. Johnson, Orbits of subplanes of Figueroa planes
• L. K. Jørgensen, Vertex arboricity of K~ minor free graphs
• L. Kalikow, Priority queues and parking functions
• G. Y. Katona, Hamiltonian chains in hypergraphs
• A. D. Keedwell, Critical sets for orthogonal latin squares
• A. Khelladi, Colouring the fibered product of graphs
• G. B. Khosrovshahi, On some existential conjectures in design theory
• K. Kilakos, On matching lattices
• G. Kiss, Arcs and their covering numbers
• M. Klazar, Extremal problems for colored trees and Davenport-Schinzel sequences
• M. Klin, On new partial geometries pg(8,9,4)
• G. Korchmáros, Collineation groups fixing an oval in a finite projective plane
• M. Krivelevich, Color-critical graphs with few edges chromatic sum problem
• M. Kubale, Computational experience with heuristic algorithms for the chromatic sum problem
• E. M. Kubicka, The lexicographic distance between rooted trees
• G. M. Kubicki, Between packable and randomly packable graphs: packer-spoiler games
• K. Kunitz, Properties of cyclic codes - an algorithmic realization in GAP
• D. Labbate, Minimally one-factorable r-regular bipartite graphs
• C. Lam, BDX
• J. D. Lamb, Pfaffians and perfect linear matroid matchings
• F. Larrión, Clique divergent graphs with unbounded sequence of diameters
• R. Laue, Graphical t-designs
• F. Lazebnik, Polarities and 2k-cycle-free graphs
• J. Leeming, Comparison of two nested row-column designs containing a control
• W. S. Leng, A short proof of the Four-Colour Theorem?
• P. A. Leonard, Extensions of Z-cyclic whist tournaments
• V. I. Levenshtein, Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes
• C. Lewis, Designs balanced for neighbour effects
• R. P. Lewis, The number of spanning trees of complete multipartite graphs
• H. Li, On the Loebl-Komlós-Sós conjecture
• Y. S. Liaw, Z-cyclic bridge tournament designs for 4n + 3
• B. Liu, On a conjecture for lower bounds of eigenvalues of trees
• E. K. Lloyd, Reaction graphs and Cayley diagrams
• S. C. Lopez, Decomposition of dense regular graphs into trees
• A. Lukács, Representation of group elements as random subproducts
• E. S. Mahmoodian, The critical sets in Latin rectangles and graphs
• L. R. Markus, a-domination
• J. Martí-Farré, Sets defining minimal vertex covers
• W. J. Martin, Ordered orthogonal arrays and ordered codes
• A. Maschietti, Difference sets and hyperovals
• M. Maureso, Endo-circulant digraphs: connection and generalized cycles
• F. McDonnell, The Fibonacci sequence and proving the minimality of 0-1 inequalities
• J. P. McSorley, Single-change circular covering designs
• C. Merino-Lopez, Chip firing and the Tutte polynomial
• M. Mitjana, Cycles in the cycle prefix digraph
• M. Molloy, Graph colouring with the probabilistic method
• J.-J. Montellano, On the linear heterochromatic number of graphs
• R. Moyano, A characterization of the graphs with projective planar line graphs
• H. M. Mulder, Induced paths with a common vertex
• J. P. Murphy, Cycle structure of STS(v)s for v \le 15
• M. Muzychuk, On the isomorphism problem for cyclic graphs
• A. Nakamoto, Transformations in closed 2-cell embeddings with specified properties
• C. St. J. A. Nash-Williams, An application of network flows to rearrangement of series
• V. Neumann-Lara, The acyclic disconnection of a digraph
• Y. Oda, Asymmetric van der Veen Conditions and the Travelling Salesman Problem
• C. M. O'Keefe, Characterisations of unitals in PG(2,q^2)
• K. Ota, Vertex-disjoint stars in graphs
• P. J. Owens, Some new Latin power sets not based on groups
• K. G. Paterson, Perfect factors - old and new results
• S. Perkins, Synchronizing codewords of q-ary Huffman equivalent codes
• N. C. K. Phillips, Tight single-change covering designs with v = 12, k = 4
• M. D. Plummer, On matching extensions with prescribed and proscribed edge sets II
• X. Portas, Isoperimetric sets in Abelian Cayley graphs
• P. Préa, Enumerating exterior self-avoiding walks
• D. A. Preece, Perfect graeco-latin balanced incomplete block designs
• L. M. Pretorius, Partition theorems for factorisations of ascending parameter words
• J. Puech, Irredundant and independent perfect neighborhood sets in graphs
• K. Quinn, Difference sets and orthomorphisms over non-abelian groups
• D. Rautenbach, The influence of special vertices on strong domination
• R. C. Read, Chromatic polynomials of homeomorphic graphs
• M. P. Revuelta, Metric properties of graphs of class 3
• E. Rivera-Campo, Covering the edges of a graph with bonds
• Y. Roditty, On broadcasting multiple messages in a communication network
• J. Rosewell, Open University software for the course MT365 Graphs, Networks and Designs
• P. Rowlinson, Star complements in graphs
• Z. Ryjácek, Closure, forbidden subgraphs and hamiltonicity
• G. Sabidussi, 3-colourability of 4-regular hamiltonian graphs
• D. P. Sanders, Edge 3-colouring cubic apex graphs
• B. Sands, An optimal algorithm for a parallel cutting problem
• I. Sarmiento, A characterisation of jointless Dowling geometries
• I. Schiermeyer, Chromatic number of classes of graphs with prescribed cycle lengths
• B. Schmidt, Towards the circulant Hadamard matrix conjecture
• J. Schönheim, New ideas on covering systems of congruences
• R.-H. Schulz, Check digit systems with error correction
• Á. Seress, Erdős-Ko-Rado and Hilton-Milner type theorems for intersecting chains in posets
• A. Shastri, Graphs, rings and colorings
• R. Shaw, A property of Alt(7) and a maximal 3-dimensional linear section of GL(4, 2)
• J. Sheehan, Minimum multiplicities of subgraphs
• M. A. Shepherd, Scaling a graph colouring problem
• P. Sinclair, Some results on graph centralization
• R. Skrekovski, List improper colorings of planar graphs
• P. Solé, Z₄-codes and lattices: a survey
• A. Sonnino, Arcs in finite Benz geometries
• B. Stevens, New recursive methods for transversal covers
• Y. Strassler, New weighing matrices of order 87t and weight 49
• B. Sudakov, The chromatic numbers of random hypergraphs
• K. J. Swanepoel, k-distance sets in normed spaces
• H. C. Swart, Twin domination in digraphs
• S. Tabirca, The unimodality of combinatorial numbers
• M. Tewes, Vertex deletion and cycles in multipartite tournaments
• H. Trommel, Pancyclicity of claw-free Hamiltonian graphs
• M. Tsuchiya, On upper bound graphs with respect to operations on graphs
• H. Tuinstra, Independence trees and Hamilton cycles
• S. Ushio, S_k-factorization of symmetric complete tripartite graphs
• S. Uttunggadewa, Shifting conjecture on 5-flow
• A. Vainshtein, Enumeration of edge-ordered graphs
• H. J. Veldman, Not every 2-tough graph is hamiltonian
• H. Verrall, Hamilton decompositions of directed wrapped butterfly graphs
• J. B. A. Verstraete, On the toughness of planar graphs
• M. T. Villar, Some eulerian and hamiltonian graphs related to 2-complexes
• B. J. Vowden, Some series of cyclic balanced hyper-Graeco-Latin superimpositions of Youden squares
• P. Wang, On the structure of extremal graphs with a lower bound on girth
• I. Wanless, Permanents, Latin rectangles and perfect matchings
• H. N. Ward, The weight enumerator of the code of the projective plane of order 5
• A. Wassermann, The construction of simple t-designs with prescribed automorphism group
• M. Watanabe, Rectangle-coverings of orthogonal polygons
• J. J. Watkins, Embedding the flower snarks
• B. Webb, Orbit theorems
• J. West, Forbidden subsequences and Chebyshev polynomials
• C. A. Whitehead, Sensitivity of the upper irredundance number to edge addition
• J. Williams, Kempe chains
• R. J. Wilson, Sylvester's work in combinatorics
• R. J. Wilson, Open University software for the course MT365 Graphs, Networks and Designs
• T. Wolf, A combinatorial puzzle solved by the genetic algorithm
• D. Woodall, Edge and total choosability in multigraphs
• A. Yeo, Vertex-critical graphs of diameter two
• R. Yuster, Packing and covering the complete graph
• N. Zagaglia Salvi, On the automorphism group of the Fibonacci semi-lattice
• I. E. Zverovich, General methods of finding forbidden induced subgraphs for hereditary classes of graphs
• V. E. Zverovich, A semi-induced subgraph characterization of upper domination perfect graphs

Back to the British Combinatorial Conferences page.