University of Durham, 11 - 15 July, 2005

Organised jointly with the Open University

- M. Abreu,
*Graphs and digraphs with all 2-factors isomorphic* - T. Adachi,
*Construction of a regular group divisible design* - F. Aguiló,
*On the Frobenius problem of three numbers: Part II* - M. Aïder,
*Balanced almost distance-hereditary graphs* - H. Ait Haddadène,
*Perfect graphs and vertex colouring problem of a graph* - T.L. Alderson,
*Optical orthogonal codes: new constructions* - I. Anderson,
*A general approach to constructing power-sequence terraces for Z_n* - J. Arhin,
*On the structure of equireplicate partial linear spaces with constant line size* - R.F. Bailey,
*Permutation groups, error-correcting codes and uncoverings* - C.A. Baker,
*Graphs with the n-e.c. adjacency property constructed from affine planes* - C. Balbuena,
*Consecutive magic graphs* - S. Ball,
*A new approach to finite semifields* - J.C. Bate,
*Group Key Distribution Patterns* - F. Bell,
*On graphs with least eigenvalue -2* - F. Benmakrouha,
*Validation of a particular class of bilinear systems* - A. Berrachedi,
*Cycle regularity and Hypercubes* - H. Bielak,
*Chromatic zeros for some medial graphs* - E.J. Billington,
*Equipartite and almost-equipartite gregarious 4-cycle systems* - A. Bonisoli,
*Factorizations with symmetry* - S. Bonvicini,
*Live one-factorizations and mixed translations in even characteristic* - P. Borg,
*Graphs with the Erdős-Ko-Rado property* - S. Bouroubi,
*Bell's number in the Alekseev inequality* - S. Brandt,
*Triangle-free graphs whose independence number equals the degree* - H.J. Broersma,
*Matchings, Tutte sets, and independent sets* - F.E.S. Bullock,
*Connected, nontraceable detour graphs* - A.C. Burgess,
*Colouring even cycle systems* - P. Butkovič,
*Max-algebra: the linear algebra of combinatorics?* - K. Cameron,
*Coflow and covering vertices by directed circuits* - P.J. Cameron,
*An orbital Tutte polynomial* - N. Cavenagh,
*A superlinear lower bound for the size of a critical set in a latin square* - P.E. Chigbu,
*Admissible permutations for constructing Trojan squares for 2n treatments with odd-prime n side* - N.E. Clarke,
*The ultimate isometric number of a graph* - C.J. Colbourn,
*Covering Arrays of Strength Two* - C.H. Cooke,
*Bounds on element order in rings Zm with divisors of zero* - A. Cossidente,
*Ovoids of the Hermitian surface and derivations* - D. Cvetković,
*Signless Laplacians and line graphs* - P. Dankelmann,
*Distance and Inverse Degree* - P. Danziger,
*More balanced hill-climbing for triple systems* - A. de Mier,
*The lattice of cyclic flats of a matroid* - M. Dewar,
*Ordering the blocks of a design* - A. Drápal,
*Surgeries on latin trades* - J.E. Dunbar,
*One small step towards proving the PPC* - K. Edwards,
*Upper bounds on planarization of bounded degree graphs* - Y. Egawa,
*Existence of disjoint cycles containing specified vertices* - L. Ellison,
*Logarithmic terraces* - C. Elsholtz,
*Maximal sets of unit-distance points* - G.E. Farr,
*On the symmetric Ashkin-Teller model and Tutte-Whitney functions* - H. Fernau,
*A sum labelling for the flower f_q,p* - H. Fernau,
*Algorithmic aspects of Queen domination* - A. Finbow,
*On well-covered planar triangulations* - H. Fleischner,
*Maximum independent sets in hamiltonian 4-regular graphs* - A.D. Forbes,
*6-sparse Steiner triple systems* - M. Frick,
*A new perspective on the Path Partition Conjecture* - J. Fujisawa,
*Long cycles passing through a linear forest* - Y. Fujiwara,
*Constructions for cyclic 4- and 5-sparse Steiner triple systems* - A.V. Gagarin,
*Structure and enumeration of toroidal and projective-planar graphs with no K_3,3s* - P. García-Vázquez,
*Optimal restricted connectivity and superconnectivity in graphs with small diameter* - N. Georgiou,
*Embeddings of trees and the best secretary problem* - M. Giudici,
*All vertex-transitive locally-quasiprimitive graphs have a semiregular automorphism* - L.A. Goldberg,
*Approximate counting: Independent sets and Ferromagnetic Ising* - M.J. Grannell,
*A flaw in the use of minimal defining sets for secret sharing schemes* - C. Greenhill,
*Bounds on the generalised acyclic chromatic numbers of bounded degree graphs* - T.S. Griggs,
*Steiner triple systems and existentially closed graphs* - U. Grimm,
*On the number of power-free words in two and three letters* - V. Grout,
*Initial results from a study of probability curves for shortest arcs in optimal ATSP tours with application to heuristic performance* - G. Gutin,
*Level of repair analysis and minimum cost homomorphism of graphs* - R. Häggkvist,
*A \Delta + 4 bound on the total chromatic number for graphs with chromatic number on the order of \sqrt(\Delta/log \Delta)* - A.J.W. Hilton,
*(r,r + 1)-factorizations of multigraphs with high minimum degree* - F. Holroyd,
*Multiple chromatic numbers of some Kneser graphs* - F. Holroyd,
*Semi-total graph colourings, the beta parameter and total chromatic number* - M. Horňák,
*General neighbour-distinguishing index of a graph* - S.K. Houghten,
*Bounds on optimal edit metric codes* - I-C. Huang,
*Variable changes in generalized power series* - S. Huczynska,
*Frequency Permutation Arrays* - B. Jackson,
*Unique realizations of graphs* - M. Jerrum,
*Two remarks concerning balanced matroids* - M. Johnson,
*Connectedness of graphs of vertex-colourings* - R. Johnson,
*Universal cycles for permutations and other combinatorial families* - L.K. Jørgensen,
*Extremal results for rooted minor problems* - T. Kaiser,
*The circular chromatic index of graphs of high girth* - Q. Kang,
*More large sets of resolvable MTS and DTS* - A.D. Keedwell,
*A new criterion for a Latin square to be group-based* - P. Keevash,
*The role of approximate structure in extremal combinatorics* - E.L.C. King,
*Comparing subclasses of well-covered graphs* - E.V. Konstantinova,
*Reconstruction of permutations from their erroneous patterns* - S. Küçükçifçi,
*Maximum packings for perfect four-triple configurations* - D. Labbate,
*Pseudo 2-factor isomorphic regular bipartite graphs* - A. Lev,
*Bertrand Postulate, the Prime Number Theorem and product anti-magic graphs* - V.I. Levenshtein,
*Reconstruction of graphs from metric balls of their vertices* - M. Liazi,
*Polynomial variants of the densest/heaviest k-subgraph problem* - N. Lichiardopol,
*Cycles in a tournament with pairwise zero, one or two given common vertices* - P. Lisoněk,
*Combinatorial families enumerated by quasi-polynomials* - N. López,
*Eccentricity sequences and eccentricity sets in digraphs* - M. Luz Puertas,
*On the metric dimension of graph products* - E. Máčajová,
*On the strong circular 5-flow conjecture* - D.F. Manlove,
*"Almost stable" matchings in the Roommates problem* - X. Marcote,
*On the connectivity of a product of graphs* - G. Marino,
*Special sets of the Hermitian surface and Segre invariants* - N. Martin,
*Unbalanced K_p,q factorisations of complete bipartite graphs* - T. Maruta,
*On optimal non-projective ternary linear codes* - H. Matsumura,
*On spanning trees with degree restrictions* - G. Mazzuoccolo,
*Doubly transitivity on 2-factors* - K.L. McAvaney,
*The Path Partition Conjecture* - C. McDiarmid,
*Random planar graphs and related structures* - B.D. McKay,
*Short cycles in random regular graphs* - C. Merino,
*On the number of tilings of rectangles with T-tetraminoes* - A. Miralles,
*On the Frobenius problem of three numbers: Part I* - A. Mohammadian,
*On the zero-divisor graph of a ring* - B. Montágh,
*New bounds on some Turán numbers for infinitely many n* - J. Moori,
*Codes, Designs and Graphs from Finite Simple Groups* - K. Mynhardt,
*Maximal increasing paths in edge-ordered trees* - M. Nakamura,
*Broken circuits and NBC complexes of convex geometries* - M.W. Newman,
*Orthogonality graphs from quantum computing* - O. Oellermann,
*The strong metric dimension of graphs* - L.-D. Öhman,
*The intricacy of avoiding arrays* - S. Ouatiki,
*On the domatic number of the 2-section graph of the order-interval hypergraph of a finite poset* - M.G. Parker,
*Graph equivalence from equivalent quantum states* - D. Paulusma,
*The computational complexity of the parallel knock-out problem* - D.B. Penman,
*Extremal Ramsey graphs* - D.A. Pike,
*Pancyclic PBD block-intersection graphs* - O. Pikhurko,
*Fragmentability of bounded degree graphs* - M.D. Plummer,
*Domination in a graph with a 2-factor* - H. Pollatsek,
*Quantum error correction codes invariant under symmetries of the square* - D.A. Preece,
*Some Z_n+2 terraces from Z_n power-sequences, n being an odd prime power* - M. Priesler,
*Partitioning a graph into two pieces each isomorphic to the other or to its complement* - E. Prisner,
*k-pseudosnakes in n-dimensional hypercubes* - T.J. Rackham,
*Local nature of Brooks' colouring* - Z. Radosavljević,
*On bicyclic reflexive graphs* - P. Rowlinson,
*Independent sets in extremal strongly regular graphs* - J.D. Rudd,
*Orbits of graph automorphisms on proper vertex colourings* - C.G. Rutherford,
*Coprime polynomials over GF(2)* - G. Sabidussi,
*Deletion-similarity versus similarity of edges in graphs with few edge-orbits* - M. Šajna,
*Self-complementary two-graphs and almost self-complementary double covers over complete graphs* - A. Sanchez-Arroyo,
*The Erdős-Faber-Lovasz conjecture for dense hypergraphs* - A. Sapozhenko,
*On the number of independent sets in graphs* - M. Sawa,
*An additive structure of BIB designs* - C. Seara,
*On monophonic sets in graphs* - S. Severini,
*Permutations and Quantum Entanglement* - R. Shaw,
*Grassmann and Segre varieties over GF(2): some graph theory links* - H. Shen,
*Mendelsohn 3-frames and embeddings of resolvable Mendelsohn triple systems* - M. Shinohara,
*Constructing linear codes from some orbits of projectivities* - S.K. Simić,
*Some new results on the index of trees* - J.E. Singleton,
*Maximal nontraceable graphs of small size* - M. Škoviera,
*Factorisation of snarks* - D.H. Smith,
*Cyclically permutable codes and simplex codes* - R. Sótak,
*Vertex-distinguishing proper edge colouring of some regular graphs* - D. Stark,
*Random preorders* - A.P. Street,
*Defining sets of full designs and other simple designs* - H.C. Swart,
*Minimal claw-free graphs* - R. Tsaur,
*Contractible digraphs, fixed cliques and the Cop-robber games* - P.-G. Tsikouras,
*Dominating sequences and traversals of ordered trees* - M. Tsuchiya,
*Chordal double bound graphs and posets* - K. Ushio,
*Balanced C_4-quatrefoil designs* - I.A. Vakula,
*Claw-free graphs with non-clique \mu-subgraphs and related geometries* - J.C. Valenzuela,
*New results on the Zarankiewicz problem* - S.A. van Aardt,
*Maximal non-traceable oriented graphs* - P. van den Berg,
*The number of edges in a bipartite graph of given order and radius* - J. van den Heuvel,
*Connectedness of graphs of 3-colourings* - A. Vietri,
*Difference families from infinite translation designs* - K. Vušković,
*Combinatorial algorithm for finding a clique of maximum weight in a C_4-free Berge graph* - R.A. Walker II,
*Tabu search for Covering Arrays using permutation vectors* - P. Wang,
*The equitable colouring of plane graphs with large girth* - I.M. Wanless,
*Perfect 1-factorisations and atomic Latin squares* - R.J. Waters,
*Some list colouring problems in the reals* - B.S. Webb,
*Representing (d,3)-tessellations as quotients of Cayley maps* - Z. Weiner,
*On some stability theorems in finite geometry* - C.A. Whitehead,
*Minimum dominating walks on graphs with large circumference* - R.W. Whitty,
*Rook polynomials on 2-dimensional surfaces* - J. Wojciechowski,
*Edge-bandwidth of grids and tori* - D.R. Woodall,
*Recent results on total choosability and edge colourings* - B. Yalaoui,
*On related combinatory problems in information cartography* - E.S. Yazici,
*Minimal homogeneous Steiner triple trades* - A. Yeo,
*Total domination in graphs* - K. Yoshimoto,
*The number of cycles in 2-factors of line graphs* - N. Zagaglia Salvi,
*On very sparse circulant (0,1) matrices* - J. Žerovnik,
*Hypercubes are distance graphs* - B. Zmazek,
*Retract-rigid strong graph bundles* - V.E. Zverovich,
*A generalised upper bound for the k-tuple domination number*

Back to the British Combinatorial Conferences page.