University of Reading, 9-13 July, 2007

- Marién Abreu,
*Configuration Graphs of Neighbourhood Geometries* - Louigi Addario-Berry,
*Acyclic improper colourings of graphs with bounded maximum degree* - Fatima Affif Chaouche,
*The Concrete Representation Problem and Hamming graphs* - S. Akbari,
*Commutativity of the Adjacency Matrices of Graphs* - T.L. Alderson,
*Complete arcs and Inextendable Codes* - Peter Allen,
*Partitioning two-coloured complete graphs into monochromatic cycles* - Ian Anderson,
*Early examples of spouse avoidance* - Gabriela Araujo-Pardo,
*Constructions of bi-regular cages* - John Arhin,
*Every SOMA(n-2,n) is Trojan* - Haris Aziz,
*Using Generating Functions to design Weighted Voting Games* - Rahil Baber,
*Almost intersecting families that are almost everything* - R.A. Bailey,
*Block designs, spanning trees and resistance in electrical networks* - Robert F. Bailey,
*Uncoverings-by-bases for graphic matroids* - Catharine Baker,
*Graphs with the n-e.c. adjacency property arising from designs* - Camino Balbuena,
*Incidence matrices of projective planes and of some regular bipartite graphs of girth 6 with few vertices* - Simeon Ball,
*On functions over a prime field that do not determine all directions* - Lali Barrière,
*The Frobenius problem: A Geometric Approach* - Siham Bekkai,
*Covering Vertices of a Graph by Cycles of Bounded Length* - Robert Berke,
*The Morphism Chromatic Number* - Abdelhafid Berrachedi,
*Special Cyclic Construction in Some Particular Graphs* - Ouahiba Bessouf,
*Transitive Closure in Bidirected Graphs* - Károly Bezdek,
*Finding the shortest billiard trajectories in disk-polygons* - Elizabeth J. Billington,
*Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts* - Arrigo Bonisoli,
*k-matching decompositions of complete graphs with non-cyclic automorphism groups* - Simona Bonvicini,
*On k-pyramidal 2-factorizations of the complete graph* - Sadek Bouroubi,
*Integer partitions and convexity* - Stephan Brandt,
*Edge colouring by total labellings* - Robert Brier,
*Algebras, identities and cycle systems* - Graham Brightwell,
*Submodular Percolation and the Worm Order* - Thomas Britz,
*Matroids applied to coding theory* - Peter Cameron,
*Optimal designs and root systems* - David Cariolaro,
*Covering graphs with matchings of fixed size* - Paula Carroll,
*Topology Design for Next Generation Telecommunications Networks* - Carl Johan Casselgren,
*Interval edge colorings of (a,b)-biregular bipartite graphs* - Nicholas J. Cavenagh,
*Path and cycle decompositions of complete equipartite graphs: four parts* - Martin Cera,
*Extremal problems for infinite graphs* - Luis Cereceda,
*Finding paths between graph colourings: complexity and distance* - Nam-Po Chiang,
*On Sum-saturability of Trees* - Nancy E. Clarke,
*A Witness Version of the Cops and Robber Game* - Alessandro Conflitti,
*Noncommutative hypergeometric and basic hypergeometric differential equations* - Oliver Cooley,
*Embeddings and Ramsey numbers of sparse k-uniform hypergraphs* - Matthew Cropper,
*k-fold list coloring cycles with Hall's condition* - Fabio Cuzzolin,
*On the relationship between the notions of independence in matroids, lattices, and Boolean algebras* - Peter Dankelmann,
*Minimum Size of Graphs and Digraphs of Given Radius* - Peter Danziger,
*The Hamilton-Waterloo problem for cycle sizes 3 and 4* - Lyes Dekar,
*[r,s,t]-coloring of Trees and Bipartite graphs* - Keith Edwards,
*Achromatic number of fragmentable graphs* - Nicole Eggemann,
*The Expected Clustering Coefficient of the Móri Graph* - Marianne Fairthorne,
*Permutation Capacity of Graphs* - Giovanni Falcone,
*Binomial coefficients modulo p^2* - Graham Farr,
*On generalised Tutte-Whitney functions* - Michael N. Ferencak,
*On completing Latin squares* - Stephen Finbow,
*OO-Irredundance in Graphs* - Art Finbow,
*On 3-Connected Well-Covered Planar Triangulations* - Sanaz Zare Firoozabadi,
*Some Lower Bounds for the Energy of Graphs* - Herbert Fleischner,
*Circuit double covers in cubic graphs with very long circuits* - Tony Forbes,
*The Design of the Century* - Nikolaos Fountoulakis,
*The order of the largest complete minor in a random graph* - Silvia Gago,
*Vertex betweenness centrality in graphs* - Pedro García-Vázquez,
*On the extremal graphs free of small cycles* - John Baptist Gauci,
*k-to-1 functions between graphs* - Nicholas Georgiou,
*The large scale structure of classical sequential growth models* - Diego González-Moreno,
*On the 2-restricted edge connectivity of Permutation Graphs* - Andrew Goodall,
*Edge colouring models for the Tutte polynomial and related graph invariants* - Boris Granovsky,
*Talk Meinardus theorem on weighted partitions: Extensions and a Probabilistic proof* - Roland Grappe,
*Covering semi-monotone functions* - Robert Gray,
*Connected-homogeneous graphs* - Ken Gray,
*Two regular solids housing the twelve (6,3,2) designs* - Simon Griffiths,
*The Erdős-Ginzberg-Ziv Theorem with Units* - Paul Grobler,
*Secure Domination Critical Graphs* - Roland Häggkvist,
*On the cycle double conjecture yet again* - Carlo Hämäläinen,
*Latin bitrades: hypermaps, tessellations, and automorphisms* - Peter Hamburger,
*On a Special Case of the Caccetta-Häggkvist Conjecture* - Houria Ait Djafer Bencherif,
*A note on cycle lengths in non-bipartite graphs* - Egbert Harzheim,
*Center-symmetric subsets of subsets of N which have infinite reciprocal sum* - Matthew Henderson,
*Embedding Latin rectangles* - Michael A. Henning,
*Total domination in 2-connected graphs* - Jan van den Heuvel,
*Some designs and codes invariant under the simple group Co_2* - Anthony Hilton,
*A-optimality and resistance in electrical networks* - Daniel Horsley,
*Embedding Partial Steiner Triple Systems* - Bill Jackson,
*Brick Partitions of Graphs* - Mohsen Jamaali,
*Jaeger's Conjecture for the Adjacency Matrices of Graphs* - Lina Jansson,
*How many will do? - List coloring latin squares* - Mark Jerrum,
*The complexity of weighted Boolean #CSP* - Robert Johnson,
*G-intersection theorems for matchings and other graphs* - Matthew Johnson,
*Mixing 3-Colourings in Bipartite Graphs* - Sian K. Jones,
*Enumeration of empty Sudoku grids* - Konstanty Junosza-Szaniawski,
*Finding covering and partition in time O(2^n)* - Gyula Y. Katona,
*Hamiltonian Chains in Hypergraphs* - A.D. Keedwell,
*Orthogonal, diagonal and subsquare-magic Sudoku squares* - André A. Keller,
*Connectivity Threshold and Vulnerability in Large Scale Macro-econometric Models* - Abdollah Khodkar,
*Minimal defining sets of 1-factorizations of complete graphs* - Dariush Kiani,
*Some Connections Between Graphs and Quadratic Forms* - György Kiss,
*Geometric constructions of large Cayley graphs* - Salima Kouici,
*Structural similarity measure for binary data clustering* - Domenico Labbate,
*Pseudo 2-factor isomorphic cubic bipartite graphs* - Dominic Lanphier,
*Isoperimetric sets of Cayley graphs* - Manoel Lemos,
*Removing circuits in graphs and matroids* - Arieh Lev,
*Universal Partitions* - Nicolas Lichiardopol,
*Dominated and dominating arcs in tournaments. Vertex strong connectivity of a doubly regular tournament* - Debbie Lockett,
*Posets, homomorphisms, and homogeneity* - Edita Máčajová,
*Hypohamiltonian cubic graphs with high cyclic connectivity* - Jim MacDougall,
*Are All Regular Graphs Vertex-Magic?* - Gary MacGillivray,
*Hamilton Paths and Cycles in Total Domination 3-Critical Graphs* - H. R. Maimani,
*Unit graph of rings* - David F. Manlove,
*Size versus stability in the Marriage problem* - Xavier Marcote,
*Some structural results for (D;g)-cages* - William J. Martin,
*An ideal way to view the cometric property?* - Geoff Martin,
*Cycle Decompositions of Circulant Graphs* - Thomas McCourt,
*The intersection problem for disjoint m-flowers in latin squares* - Meriem Mechebbek,
*On b-perfect chordal graphs* - Kahina Meslem,
*Isometric embedding of subdivided graphs in the hypercube* - Mariusz Meszka,
*k-Cycle free one-factorizations of complete graphs* - Dara Moazzami,
*Tenacity and Edge-tenacity in Networks: A Survey* - F. Mohammadi,
*On M_r(k)-Graphs* - Koji Momihara,
*On Tight Conflict-Avoiding Codes of Weight Three* - Balázs Montágh,
*Ramsey's Theorem under density conditions* - Christopher W. Monteith,
*Practically deciding equivalence of linear codes* - Alessandro Montinaro,
*Transitive t-parallelisms in PG(n,q)* - Jamshid Moori,
*Some designs and codes invariant under the simple group Co_2* - Somayeh Moradi,
*2-List Colorability of Graphs with Special Lists* - Kerri Morgan,
*Approximation Algorithms for the Maximum Induced Planar and Outerplanar Subgraph Problems* - Egbert Mujuni,
*Parameterized Complexity of Biclique Cover* - Eric Mwambene,
*Groupoids representing generalised Petersen graphs* - Kieka Mynhardt,
*Regular Graphs are not Universal Fixers* - Mounira Nekri,
*On some properties of Dynamic graphs* - Steve Noble,
*Three Equivalent Graph Polynomials* - Lars-Daniel Öhman,
*Latin Squares with Prescriptions and Restrictions* - Mika Olsen,
*On two conjectures of Victor Neumann-Lara* - Behnaz Omooi,
*On the b-coloring of some special graphs* - Arthur Hoffman Ostenhof,
*A Counterexample to the Bipartizing Matching Conjecture* - Viresh Patel,
*Simultaneous Graph Cuts* - Daniel Paulusma,
*Tight upper bounds for parallel knock-out numbers* - David B. Penman,
*Extremal Ramsey Graphs* - Adam Philpotts,
*Ore-type conditions for a hamiltonian cycle containing a given matching* - David A. Pike,
*Existential Closure and BIBD Block-Intersection Graphs* - Michael D. Plummer,
*On the matching extendability of graphs in surfaces* - D.A. Preece,
*Combinatorially fruitful properties of 3 . 2^{-1} and 3 . 2^{-2} modulo p* - Kathleen Quinn,
*Smallest defining sets of directed triple systems* - Sandro Rajola,
*Some necessary conditions for a graph to be hamiltonian* - Farzaneh Ramezani,
*Constructing cospectral graphs* - Gloria Rinaldi,
*1-rotational k-factorizations of the complete graph: examples and recursive constructions* - Rebecca Robinson,
*Structure and recognition of graphs with no 6-wheel subdivision* - Jason Rosenhouse,
*Decompositions of Cayley Graphs of Matrix Groups Over a Finite Field* - Peter Rowlinson,
*A characterization of the Hoffman-Singleton graph* - Jason Rudd,
*Proper Vertex Colourings and Graph Automorphisms* - Beatrice Ruini,
*Computations of full automorphism groups of certain cubic graphs* - Carrie Rutherford,
*Polynomial coprimality* - Gert Sabidussi,
*Minimal asymmetric graphs* - Joe Sawada,
*Generating Meanders* - John Schmitt,
*Minimum Bipartite-Saturated Graphs* - James Sellers,
*Tiling Proofs of Recent Sum Identities Involving Pell Numbers* - Paul Seymour,
*Even Pairs in Perfect Graphs* - Ron Shaw,
*The associate U^{#} of a flat U with respect to a cubic hypersurface in PG(5,2)* - Bernd Sing,
*Visible Ammann-Beenker Points* - Martin Škoviera,
*Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups* - Pavel Skums,
*Edge reconstruction of decomposable split graphs* - Derek Smith,
*Hadamard Partitions and the Security of Loosely Synchronized Codes* - Michael B. Smyth,
*Dimension of Graphs* - Nasrin Soltankhah,
*Total domination subdivision numbers of Cartesian product* - Dudley Stark,
*Asymptotic Enumeration of Line Graphs and 2-Covers* - Anne Penfold Street,
*Constructing defining sets of full designs* - John Talbot,
*How to remember birthdays* - Behruz Tayfeh-Rezaie,
*Graphs cospectral to starlike trees* - Dirk Oliver Theis,
*Geometry of metrics embeddable in the real line* - Norihide Tokushige,
*A product version of the Erdős-Ko-Rado theorem* - Rocco Trombetti,
*Cyclic and Generalized Cyclic Semifields* - P. Tsikouras,
*A bijective approach for the enumeration of strings in Dyck paths* - Zsolt Tuza,
*Partition-crossing: Steiner systems, connectivity and Turán's problem* - Ushio Kazuhiko,
*Balanced C_3-Sixfoil Designs* - J.C. Valenzuela,
*Forbidden substructures in bipartite graphs* - E.R. Vaughan,
*Cyclic Orderings of Matroids* - P.D. Vestergaard,
*Packing 3-paths into graphs* - Andrea Vietri,
*The Graceful Collage tool yields new graceful labellings* - Ian Wanless,
*Cycle structure of random latin squares* - Rob Waters,
*The duplicity of zero-one matrices* - Adam Watson,
*The combinatorics of rigidity* - Bridget S. Webb,
*On sparse CISTs* - Robin Whitty,
*Graceful labellings and intersecting sets of permutations* - Emine Şule Yazıcı,
*A new algorithm for finding the full set of minimal defining sets of t-designs* - Corrado Zanella,
*On finite linear complexes and line partitions* - Michele Zito,
*Colouring random empires in random trees* - Vadim Zverovich,
*The k-Tuple Domination Number Revisited*

Back to the British Combinatorial Conferences page.