University of Kent at Canterbury, 12-16 July, 1999

- Francesc Aguiló,
*Discrete dynamics over double-loop digraphs* - Ian Anderson,
*Early Kentish cyclic whist tournaments* - Kiyoshi Ando,
*Edge version wide-diameter graphs with diameter d* - Daniel Andrén,
*Trees with the same Ising partition function* - Rosemary Bailey,
*Suprema of association schemes* - Camino Balbuena,
*The diameter vulnerability of generalized compound graphs* - Janos Barat,
*Operations which preserve path-width at most two* - David Bedford,
*On bipartite tournaments balanced with respect to carry over effects* - Lowell Beineke,
*The Mean Connectivity of a graph* - Francis Bell,
*Characterizing line graphs by star complements* - Frank Bennett,
*Steiner pentagon packing and covering designs* - Halina Bielak,
*Roots of chromatic polynomials* - Norman Biggs,
*Calculating Chromatic Polynomials* - Elizabeth Billington,
*The \mu-way intersection problem for cycle systems* - Anthony Bonato,
*The hunt for the nE.C. graphs* - Arrigo Bonisoli,
*On irreducible collineation groups fixing hyperovals* - Paul Bonnington,
*Vertex accumulation points in infinite planar graphs* - Richard Booth,
*Oriented Lagrangian matroids and maps on surfaces* - Neal Brand,
*Geodetic rays in infinite planar graphs* - Marco Buratti,
*Regular designs: the method of sieved differences* - Neil Calkin,
*Asymptotic behaviour of averaging sequences* - Kathie Cameron,
*Pivoting to find a second degree-constrained spanning tree* - Peter Cameron,
*The pigeonhole property for tournaments* - Eduardo Canale,
*New expansions for Kautz graphs* - Àngeles Carmona,
*Boundary value problems on networks: the effective resistance* - Natalia de Castro,
*Orthogonal tessellation representation of graphs on surfaces* - Nicholas Cavenagh,
*Minimal base sizes and proper k-covers* - J. S. R. Chisholm,
*Clifford algebras and Sylvester matrices* - Ernie Cockayne,
*Ramsey properties of generalised irredundant sets in graphs* - Edwin van Dam,
*Fissions of classical self-dual association schemes* - David Day,
*On the total distances of sets of vertices in graphs* - Ulrich Dempwolff,
*Ovoids and number theory* - Jean Dunbar,
*Path kernels and partitions* - Jack Edmonds,
*Parity Theorems of Binary Arithmetic* - Keith Edwards,
*Fragmentability of graphs* - Omer Egecioglu,
*Generating functions for linear diophantine systems with applications* - Anthony Evans,
*Mutually orthogonal Latin squares based on groups* - Sergei Evdokimov,
*Separation and security numbers of coherent configurations* - Josep Fàbrega,
*Extraconnectivity of digraphs* - Ralph Faudree,
*Edge disjoint monochromatic triangles in 2-coloured graphs* - Odile Favaron,
*Hamiltonicity in 3-connected claw-free graphs* - Marietjie Frick,
*Path partitions and detour maximal subgraphs* - Dalibor Froncek,
*Symmetric graph designs on friendship graphs* - Iris Gaber,
*Optimal line broadcasting in trees* - Andras Ga'cs,
*Directions of points sets in AG(2,p) and applications* - Stefanie Gerke,
*Weighted colouring and imperfection* - Joan Gimbert,
*Enumeration of almost Moore digraphs of diameter two* - Ronald Gould,
*Two-factors with few cycles in claw-free graphs* - Mike Grannell,
*Nearly the end of the anti-Pasch conjecture (?)* - Catherine Greenhill,
*A new analysis of the Glauber dynamics for graph colourings* - Terry Griggs,
*Defining sets of directed triple systems* - Harald Gropp,
*On nonexistence onditions of (r,1)-designs* - Gregory Gutin,
*How to find a travelling salesman tour which is better than many others?* - Roland Häggkvist,
*On the Ising Model* - Angèle Hamel,
*Sorting permutations with data structures* - Frank Harary,
*The Gossip problem as a model for computer communication* - Heiko Harborth,
*Ramsey numbers in octahedron graphs* - Bert Hartnell,
*On minimizing the effects of fire or a virus on a network* - Lars Hellström,
*Algebraic dependence of commuting differential operators* - Ray Hill,
*On (q^2+q+2,q+2)-arcs in the projective plane PG(2,q)* - Anthony Hilton,
*Aspects of edge-list colourings* - Fred Holroyd,
*Modular gracious labellings of trees* - Glenn Hurlbert,
*On pebbling thresholds for graph sequences* - Cecile Huybrechts,
*A unified construction for c*.c-geometries in PG(3,q)* - Yoshiyasu Ishigami,
*Diagonal-rectangle covers of orthogonal polygons* - Bill Jackson,
*Applications of graph connecting to network reliability* - Mark Jerrum,
*Coupling random walks on vertex- and edge-colourings of graphs* - Christopher Jones,
*The non-existence of some ternary linear codes* - Leif Jørgenson,
*Directed strongly regular graphs* - Dieter Jungnickel,
*Packing and covering group with subgroups* - Atsushi Kaneko,
*On spanning trees without crossings in a complete bipartite geometric graph* - Ken-ichi Kawarabayashi,
*A new approach to the Lovász-Woodall conjecture* - Donald Keedwell,
*A characterization of the Jacobi logarithms of a finite field* - Hamamache Kheddouci,
*Partially square graphs, hamiltionicity and circumference* - Abdelkader Khelladi,
*Tensions and potentials in bidirected graphs* - Peter Kirschenhofer,
*On generalised Fibonacci graphs and Fibonacci representations of integers* - Andrzej Kisielewicz,
*Planarity drawing for ordered sets* - Mikhail Klin,
*Computer package COCO: new examples of applications* - Martin Kochol,
*Polynomials associated with nowhere-zero flows* - Gabor Korchmaros,
*Some group-theoretic characterizations of classical unitals* - Mekkia Kouider,
*The b-chromatic number of a graph* - Matthias Kriesell,
*Local spanning trees in graphs and hypergraph decomposition with respect to edge connectivity* - Domenico Labbate,
*Characterizing minimally 1-factorable bigraphs* - Esther Lamken,
*Room squares and self orthogonal Latin squares* - Ivan Landjev,
*Arcs in projective Hjelmslev geometries and linear codes over finite chain rings* - Serge Lapiquonne,
*Partially square graphs and dominating cycles* - Wilfrid Leng,
*Point-packings: problems, methods, applications* - Y. S. Liaw,
*Construction of Z-cyclic directed whist tournaments* - Susana López,
*Minimum degree and the tree number* - Per Håkan Lundow,
*Compression of transfer matrices* - Gary MacGillivray,
*The achromatic number of the union of paths* - Sònia Mansilla,
*Construction of k-arc regular digraphs* - Xavier Marcote,
*The Jordan normal form of a line digraph* - Klas Markström,
*Asymptotic enumeration of independent sets and k-colourings of grid graphs* - Nigel Martin,
*More K*_{p, q}factorisations of K_{n,n} - Colin McDiarmid,
*Graph imperfection* - Sean McGuinness,
*Double covers of cubic graphs of oddness 4* - John McSorley,
*On K*_{p}-removable sequences of graphs - Criel Merino,
*Forest, colourings and acyclic orientations of the square lattice* - Margarida Mitjana,
*On the spectrum of a vertex symmetric digraph* - Dara Moazzami,
*On networks with maximum graphical structure, tenacity T and number of vertices p* - Mike Molloy,
*Cores in random graphs* - J. J. Montellano-Ballesteros,
*Heterochromatic cycles in complete graphs* - John Morgan,
*Orthogonal collections of Latin squares* - Margaret Morton,
*Domination conditions for tournaments* - Martyn Mulder,
*Graphs with prescribed spanning trees* - Francisco Antonio Muntaner,
*The place of super edge-magic labellings among other classes of labellings* - Mikhail Muzychuk,
*Generalized table algebras and association schemes* - Christine Mynhardt,
*Domination parameters and critical graphs with respect to edge removal* - Wendy Myrvold,
*Stop minding your P's and Q's : A simplified O(n) planar embedding algorithm* - Steven Noble,
*Graph embedding and data arrangement* - Yoshiaki Oda,
*On geometric independency trees of the set of points in the plane* - Haruko Okamura,
*On the chromatic number of graphs* - Peter Owens,
*Step-by-step construction of graeco-latin squares* - James Oxley,
*A sharp bound on the size of a connected matroid* - Constantinos Papadopoulos,
*Algorithms for finding good column permutations of codes* - I. Papoutsakis,
*Two structure theorems on tree spanners* - Wojtek Peisert,
*All self-complementary symmetric graphs* - Ignacio Pelayo,
*Using the parameter l to study connectivities of graphs and digraphs* - David Penman,
*Random graphs with correlation structure* - Stephanie Perkins,
*Extended synchronising codewords for q-ary prefix codes* - Nick Phillips,
*Finding tight single change covering designs with v=20, k=5* - Michael Plummer,
*On restricted matching extension in planar graphs* - Donald Preece,
*Kentish combinatorics* - Donald Preece,
*Nested balanced incomplete block designs* - Lou Pretorius,
*Partitions of factorisations of parameter words* - Joël Puech,
*On domination and annihilation in graphs with claw-free blocks* - Kathleen Quinn,
*Mendelsohn directed triple systems* - Bert Randerath,
*Characterisation of graphs with equal domination and matching number* - Dieter Rautenbach,
*On vector orderings and the stability number in triangle-free graphs* - David Rees,
*Nested pergolas* - Gloria Rinaldi,
*Regular sets of points in finite Minkowski planes* - Andy Robertshaw,
*Triangles and neighbourhoods of independent sets in graphs* - Chris Rodger,
*Four cycle systems with forest or cycle leaves* - Yehuda Roditty,
*Monotone paths in edge-ordered graphs* - Peter Rowlinson,
*Characterizing graphs by star complements* - Carrie Rutherford,
*The Tutte polynomial of a matroid with repeated elements* - Abdellah Salhi,
*An evolutionary approach for searching the space of basic solutions in linearly constrained optimisation* - Ingo Schiermeyer,
*3-colourability and forbidden subgraphs* - Jochanan Schönheim,
*On colored designs* - Barack Shoham,
*Efficient line broadcasting in a d-dimensional grid* - Robert Shrock,
*Chromatic/Tutte polynomials and their zeros and asymptotic limits for families of graphs* - Riste Skrekovski,
*Grötzsch theorem for the hypergraph of maximal cliques* - Derek Smith,
*Frequency assignment problems with multiple interference* - Angelo Sonnino,
*1-factorisations of complete multigraphs arising from arcs in finite projective planes* - Dudley Stark,
*Distribution of small subgraph counts in a random graph* - Henda Swart,
*On the average edge-connectivity of a graph* - Tibor Szabo,
*On a generalization of the Erdős-Szekeres Theorem* - Peter Sziklai,
*Linear pointsets and k-blocking sets* - Meike Tewes,
*The ratio of the longest cycle and longest path in semicomplete multipartite digraphs* - Morimasa Tsuchiya,
*On distances of posets whose bound graphs are the same* - Kazuhiko Ushio,
*K_{p,q}-factorization of symmetric complete tripartite digraphs* - M Alessandra Vaccaro,
*The action of the symplectic group associated with a quadratic extension of fields* - Jan Van den Heuvel,
*Colouring the square of a planar graph* - Wal Wallis,
*Factoring the cartesian product of a cubic graph and a triangle* - Timothy Walsh,
*Gray codes for involutions* - Ping Wang,
*On network virus control* - Mamoru Watanabe,
*Fibonacci-like trees and their related polynomials* - Bridget Webb,
*Fisher's inequality, Block's lemma and infinite designs* - Zsuzsa Weiner,
*On 1-blocking sets in PG(n,q)* - Roger Whitaker,
*On bounding the size of a set of mutually quasi-orthogonal Latin squares* - Carol Whitehead,
*The watchman's walk problem* - Jini Williams,
*How far from a type 1 graph does a type 2 graph have to be?* - Wolfram Wirth,
*The Higman design and its relatives* - Kathryn Wood,
*Pushing the cycles out of multipartite tournaments* - Kiyoshi Yoshimoto,
*On a 2-factor with a specified edge* - Roger Yu,
*Generalisation of matching extension in graphs* - Norma Zagaglia Salvi,
*On the Lucas lattices* - Xiaoya Zha,
*The spectral radius of graphs on surfaces* - Nick Zhao,
*3-coloring graphs embedded in surfaces*

Back to the British Combinatorial Conferences page.