University of Wales, Bangor, 30 June - 4 July, 2003

- M. Abbas,
*Brittle graphs and preference structure* - F. Affif Chaouche,
*An extension of hypercubes* - M. Aïder,
*Preserved induced distance graphs* - H. Ait Haddadène,
*A generalisation of colouring perfect degenerate graphs* - E. E. Allen,
*Bitableaux bases for some Garsia-Haiman modules* - I. Anderson,
*Some power-sequence terraces for Z_n with as few segments as possible* - K. Ando,
*Trivially noncontractible edges in a contraction critically 5-connected graph* - J. A. Arhin,
*Is every SOMA(n - 2, n) Trojan?* - R. A. Bailey,
*Variance in block designs whose graphs are distance-regular* - R. F. Bailey,
*Decoding the Mathieu group M_12* - M. C. Balbuena,
*On the connectivity of P_k-path graphs* - L. M. Batten,
*Broadcast anti-jamming* - R. Bean,
*Integer programming and critical sets* - F. K. Bell,
*On graphs with a path or cycle as star complement for -2* - A. Bonisoli,
*Factorisations of complete graphs with one-factors in excess* - R. F. Booth,
*Genetic algorithms and groups* - S. Bouroubi,
*New identities for Bell's polynomials: new methods* - C. Bracken,
*Construction of new quasi-3 and quasi-symmetric designs using Latin squares and Hadamard matrices* - J. M. N. Brown,
*On the action of GL(n + 1,q) on PG(n,q^t)* - D. Bryant,
*Decomposing complete graphs into specified 2-factors and Hamiltonian cycles* - M. Buratti,
*The method of partial differences for the construction of cyclic or 1-rotational cycle systems* - P. J. Cameron,
*Covering radius of sets of permutations* - N. J. Cavenagh,
*3-homogeneous latin trades* - K. Chicot,
*Countable lower 1-transitive linear orders* - R. Cowen,
*G-free colourability compactness and the boolean prime ideal theorem* - D. Cvetkovic,
*Spectral moments of fullerene graphs* - P. Dankelmann,
*Average distance in directed graphs and tournaments* - J. A. Davis,
*Negative Latin square partial difference sets in nonelementary abelian 2-groups* - J. De Beule,
*Minimal t-covers and maximal partial t-spreads of polar spaces* - S. De Winter,
*Elation and translation semipartial geometries* - F. Didehvar,
*Group decision making* - K. J. Edwards,
*A lower bound for the harmonious chromatic number* - Y. Egawa,
*Graphs G for which both G and \bar(G) are contraction critically k-connected* - L. H. M. Ellison,
*Z-cyclic ordered triplewhist tournaments on p elements, where p = 5(mod 8)* - C. Eslahchi,
*c-perfect k-uniform hypergraphs* - G. Farr,
*On monochromatic component size for improper colourings* - B. Farzad,
*On Gallai's conjecture on the minimum number of edges in colour-critical graphs* - N. J. Finizio,
*Some new Z-cyclic whist tournament designs* - S. L. Fitzpatrick,
*Well paired-dominated graphs* - T. Forbes,
*Independent sets in Steiner triple systems* - S. Fujita,
*Some results concerning the existence of vertex-disjoint subgraphs in graphs* - A. V. Gagarin,
*How to detect a projective planar or toroidal graph* - N. Georgiou,
*The dimension of a random binary order* - L. Gionfriddo,
*Nesting kite and 4-cycle systems* - L. A. Goldberg,
*Randomly sampling colourings of Z^2* - J. Goldwasser,
*Erdős-Ko-Rado with conditions on the minimum complementary degree* - A. J. Goodall,
*Edge 3-colouring cubic graphs: some probabilistic properties* - M. J. Grannell,
*Topological embeddings of Latin squares* - T. S. Griggs,
*Hamiltonian embeddings of complete graphs* - H. M. Gustafson,
*Analysis of statistical flaws in the RC4 encryption algorithm* - R. Häggkvist,
*On the cycle double conjecture* - J. H. Hattingh,
*Total k-subdominating functions on graphs* - A. J. W. Hilton,
*The amalgamation problem for transitive triple systems* - J. W. P. Hirschfeld,
*Caps on a Hermitian variety* - F. Holroyd,
*Classes of graphs with the Erdős-Ko-Rado property* - M. Jerrum,
*Expansion of the bases-exchange graph of a matroid* - M. Johnson,
*Factorisations of complete equipartite graphs* - L. K. Jørgensen,
*Rank of adjacency matrices of regular directed graphs* - G. Y. Katona,
*m-path cover saturated graphs* - A. D. Keedwell,
*Partially orthogonal Latin squares and 'near' projective planes* - A. Khelladi,
*Paths and matroid of flows in bidirected graphs* - P. Kirschenhofer,
*Combinatorial diophantine equations between second order recursive polynomials* - Gy. Kiss,
*Small semiovals* - A. E. Koller,
*Minimum span for the frequency assignment problem* - C. Y. Ku,
*Intersecting families of permutations* - J. D. Lamb,
*Covering blocks with paths and circuits* - R. C. Laskar,
*Generalised matchings in graphs* - A. Lev,
*Dense graphs are antimagic* - N. Lichiardopol,
*Independence number of iterated line digraphs* - P. Lisonek,
*Dependency of doubled caps* - E. K. Lloyd,
*What did Redfield tell Littlewood?* - P. H. Lundow,
*On the Log-concavity conjecture for chromatic polynomials* - G. MacGillivray,
*A characterisation of k-cop-win graphs and digraphs* - B. Maenhaut,
*Least common multiples of cubes* - E. S. Mahmoodian,
*On the size of the minimum critical set of a Latin square* - H. R. Maimani,
*Eigensharp and almost eigensharp graphs* - N. Martin,
*Unbalanced complete bipartite K_1,q factorisations* - T. Maruta,
*Extendability of quaternary linear codes* - D. Mayhew,
*Equitable matroids* - B. D. McKay,
*Asymptotic enumeration of bipartite graphs by degree sequence* - J. P. McSorley,
*Balanced grids* - C. Merino,
*On spanning trees and cycles of multicoloured point sets with few intersections* - L. Milazzo,
*Bicolouring Steiner systems S(2,4,v)* - D. Moazzami,
*Construction of graphs with maximum graphical structure and tenacity* - B. Montágh,
*Ramsey-like theorems for balanced colourings* - Y. Mutoh,
*Multiple edge-coloured graph decompositions of complete graphs and their applications* - S. D. Noble,
*Generalisations of graph colouring with constraints at two distances* - R. J. Nowakowski,
*Regularities in hexadecimal games* - M. A. Ollis,
*On terraces for abelian groups* - B. Omoomi,
*On the defining numbers of cartesian product of cycles* - D. Orden,
*The polytope of non-crossing graphs on a planar point set* - D. B. Penman,
*Freese-Nation numbers of finite posets* - S. Perkins,
*Variable length codes that synchronise* - C. Pinter,
*A hypercube problem* - M. D. Plummer,
*Forbidden subgraphs and bounds on the size of a maximum matching* - H. Pollatsek,
*Permutationally invariant codes for quantum error correction* - D. A. Preece,
*The seven classes of 5 x 6 triple arrays* - M. Priesler,
*Multigraph decomposition into matchings and into multistars* - G. Rinaldi,
*Unital-derived arcs are robust under multiple derivation* - A. Robertshaw,
*Independent cycles covering specified edges* - P. Rowlinson,
*The multiplicity of graph eigenvalues* - J. L. Ruiz,
*De Bruijn and Kautz digraphs of a rooted tree* - C. G. Rutherford,
*Covering radii are not matroid invariants* - A. Sali,
*Small forbidden configurations: the 3-rowed case* - P. Sant,
*Classes of the problem of colouring pairs of binary trees that can be solved in linear time* - C. Seara,
*On the Steiner set problem in graphs* - J. Siemons,
*The reconstruction index of some permutation groups* - D. H. Smith,
*Mixed error-correcting codes* - L. H. Soicher,
*A web-based resource for design theory* - C. J. Swanepoel,
*Symmetry and the Ramsey degrees of bipartite graphs* - H. C. Swart,
*Average distance in bipartite graphs* - J. Talbot,
*Compression and the Erdős-Ko-Rado property for graphs* - B. Tayfeh-Rezaie,
*Large sets of t-designs of prime sizes* - R. Tsaur,
*The Baillon-Simons almost fixed point theorems* - P. G. Tsikouras,
*The set of noncrossing partitions with fixed points* - K. Ushio,
*Balanced {C4,C5}-quatrefoil systems* - P. Vandecasteele,
*Near polygons: some classification results* - A. Vietri,
*Cyclic k-cycle systems of order 2kn + k: a solution of the last open cases* - T. R. Walsh,
*Efficient enumeration of sensed planar maps* - C. Wang,
*On Eulerian and regular perfect path double covers of graphs* - P. Wang,
*Simultaneously colouring edges and faces of series-parallel graphs* - I. M. Wanless,
*The Dittert conjecture for permanents* - M. Watanabe,
*On a separation graph which has an internal plane triangulation as a subgraph* - B. S. Webb,
*A family of latin squares with no subsquares* - J. West,
*Perfect matchings for the Gale-Robinson sequence* - J. Williams,
*Kempe chains* - N. C. Wormald,
*The size of the 2-core in a random graph* - A. Yeo,
*Domination analysis of combinatorial optimisation problems* - V. E. Zverovich,
*Basic graphs*

Back to the British Combinatorial Conferences page.