University of Exeter, 4-8 July, 2011

- Marién Abreu,
*Families of Small Regular Graphs of Girth 5* - F. Affif Chaouche,
*k-chord pancyclicity* - Hacene Ait Haddadene,
*Sequential Coloring with trichromatic Exchange* - Mohamed Ridha Alaimia,
*The r-particity of a Graph* - Michael Albert,
*Separable permutations* - Patrick Ali,
*The Radius of k-Connected Planar Graphs with Bounded Faces* - Kiyoshi Ando,
*Average degree of minimally contraction-critically 6-connected graphs* - Robert F. Bailey,
*Resolving Sets for Incidence Graphs* - Catharine Baker,
*Decomposition of complete tripartite graphs into gregarious 6-cycles* - Edward J. L. Bell,
*The forbidden-substructures of word-representable digraphs* - Elizabeth J. Billington,
*Complete sets of metamorphoses of twofold 4-cycle systems into twofold 6-cycle systems* - Simon R. Blackburn,
*The Probability that a Pair of Group Elements are Conjugate* - Arrigo Bonisoli,
*Graph-designs with balanced type conditions* - Simona Bonvicini,
*1-rotational Steiner triple systems* - Peter Borg,
*Cross-intersecting families of sets* - Tim Boykett,
*The opposite of a Latin Square?* - Stephan Brandt,
*A degree bound for vertex decomposable graphs* - Andrea Burgess,
*Generalized packing designs* - Sera Cakiroglu,
*Optimal Block Designs and Geometries* - Peter J. Cameron,
*Random synchronization and Joyal's proof* - Ben-shung Chow,
*A question for the independence definition in the Sperner family: Is it too loose?* - Nancy E. Clarke,
*Injective Oriented Colouring* - Páidí Creed ,
*The number of Euler tours of a random d-in/d-out graph* - Péter Csikvári,
*Applications of the Kelmans transformation* - Konrad K. Dabrowski,
*The Complexity of Risk-Free Marriage* - Peter Dankelmann,
*Codes from Incidence Matrices of Graphs* - Peter Danziger,
*Covering arrays with row limit w=4* - Bart De Bruyn,
*Hyperplanes of DW(5,K) containing a quad* - Fatih Demirkale,
*Constructing D-optimal Symmetric Discrete Choice Experiments* - Aleš Drápal,
*On toroidal latin bitrades* - Andy L. Drizen,
*A Markov Chain For Combinatorial Designs with Block-Size 3* - Keith Edwards,
*Planarization, with an application to Finite Automata* - Mark Ellingham,
*Hamilton cycle embeddings of complete tripartite graphs* - Anthony B. Evans,
*The existence of strong complete mappings* - R. M. Falcón,
*Partial Latin squares related to a given autotopism* - Szabolcs L. Fancsali,
*The number of directions determined by less than q points* - Tony Forbes,
*Geometric Graph Designs* - John Baptist Gauci,
*Continuous k-to-1 functions between complete graphs for even values of k* - Nicholas Georgiou,
*The simple harmonic urn* - Nick Gill,
*Is Babai afraid of spiders?* - Michael Giudici,
*Generalised quadrangles with a group acting primitively on points and lines* - Przemysław Gordinowicz,
*On automorphisms of the countable p.e.c. graph* - Mike Grannell,
*Pasch trades with a negative block* - Mariusz Grech,
*Abelian symmetry groups of boolean functions. Solution of Clote and Kranakis problem.* - Catherine Greenhill,
*Sampling regular directed graphs in polynomial time* - Roland Häggkvist,
*Probabilities for finding latin squares in a random array* - Jonas Hägglund,
*The Cycle Double Cover Conjecture and the Hunting of the Snark* - Rhiannon Hall,
*Skeleton Matroids and Representability* - Tamás Héger,
*(k,6)-graphs arising from PG(2,q)* - Lars Hellström,
*A More General Edge Elimination Polynomial* - Sven Herrmann,
*Treelike k-Dissimilarity Maps* - Timothy J. Hetherington,
*List total arboricity of 2-degenerate graphs* - Jan van den Heuvel,
*Extending Fractional Pre-colourings* - A. J. W. Hilton,
*The cover-index of a graph* - J. W. P. Hirschfeld,
*Curves of genus 3 over a finite field* - Daniel Horsley,
*Trails of triples in Steiner triple systems* - Hossein Teimoori Faal,
*Weighted Clique Polynomials and Their Applications* - Sophie Huczynska,
*Generalizing sum-free sets* - Matt Hurshman,
*Fractional Chip Firing* - Bill Jackson,
*Counting 2-Connected Deletion-Minors of Binary Matroids* - Matthew Johnson,
*Reconfigurations of graph colourings of chordal graphs* - Robert Johnson,
*Turán and Ramsey Properties of Subcube Intersection Graphs* - A. Donald Keedwell,
*Construction of bimagic squares using orthogonal Sudoku squares* - Mitchel T. Keller,
*The Reversal Ratio of a Poset* - S. Kerdjoudj,
*Proper injective chromatic number of a graph* - Andrzej Kisielewicz,
*Totally Symmetric Colored Graphs* - Midori Kobayashi,
*Exact coverings of 2-paths with Hamilton cycles for the complete bipartite graph* - Salima Kouici,
*Some properties of Binary Data Similarity Measures.* - Marcin Krzywkowski,
*Hat problem on a graph* - Jorma Kyppö,
*The Enumeration of Knight Graphs* - Domenico Labbate,
*Characterizations of regular graph with conditions on their 2-factors* - Hiu-Fai Law,
*The number of F-matchings in a tree* - Allan Lo,
*F-factors in hypergraphs via absorption* - Klas Markström,
*The thresholds for diameter 2 of random cayley graphs* - William J. Martin,
*Irrational Cometric Association Schemes* - Thomas A. McCourt,
*Biembedding a Steiner triple system with a Hamilton decompostion of K_n* - Brendan D. McKay,
*Degree Sequences of Random Graphs* - Terry McKee,
*Sparseness Conditions on Chordless Vertices of Cycles* - Kitty Meeks,
*Flood-filling Games on Graphs* - Dirk Meierling,
*Restricted edge connectivity in graphs with bounded clique number* - Criel Merino,
*On the h-vector of a paving matroid* - N. A. Messaoudi,
*Numerical solution for optimal control of the Fisher equation by decomposition method* - Margaret-Ellen Messinger,
*Graph Cleaning: Sequential versus Parallel* - M. J. Morgan,
*A Lower Bound on the Eccentric Connectivity Index of a Graph* - Eunice Mphako-Banda,
*A Note on chi-equivalence of graphs and matroids* - Syeda Rabab Mudakkar,
*On characterization and stochastic ordering of shift operator* - S. Mukwembi,
*On the Degree Distance of a Graph* - Augustine O. Munagi,
*Parity Alternating Permutations and Successions* - Kieka Mynhardt,
*A Class of Graphs with Depression Three* - Zoltán Lóránt Nagy,
*An elementary polynomial approach to the Dyson-type constant term identities* - Mounira Nekri,
*The Best Swap Edge for caterpillars and complete binary trees* - Steven D. Noble,
*The Tutte Polynomial Characterizes Simple Outerplanar Graphs* - Jongyook Park,
*There are only finitely many distance-regular graphs with valency k at least three, fixed ratio k_2/k and large diameter* - David Penman,
*Fixed point polynomials of permutation groups: analogies with chromatic polynomials?* - David Pike,
*Hamilton Cycles in Restricted Block-Intersection Graphs* - Sahar Qajar,
*Some Bounds for the Roman Domination Number of Graphs* - Gloria Rinaldi,
*Symmetric Solutions to Oberwolfach Problems* - Penying Rochanakul,
*Two-level fingerprinting codes: bounds and constructions* - Peter Rowlinson,
*On Graphs with an Eigenvalue of Maximal Multiplicity* - Carrie G. Rutherford,
*On the structure and density of sign-P-matrices and their associated graphs* - Alia Sajjad,
*Optimality in sparse block designs with 2b=v* - Matthew J. Samuel,
*The number of weak order intervals* - Uwe Schauz,
*Anti-Codes in Terms of Berlekamp's Switching Game* - Ben Seamone,
*Colourings Derived from Weightings* - Marithania Silvero,
*Using Graph Theory to study graphicable algebras* - Jozef Širáň,
*Nonorientable regular maps of any given type over linear fractional groups* - Simon M. Smith,
*Distinguishability of infinite graphs* - Justin Southey,
*Domination in cubic graphs* - Dudley Stark,
*The asymptotic number of spanning forests of complete bipartite graphs* - Douglas S. Stones,
*Congruences for the number of labelled forests* - Gabriel Sueiro,
*Forbidden induced subgraphs for near perfect matchings* - Marek Szykuła,
*Rainbow induced subgraphs in proper vertex colorings* - M. A Tahraoui,
*Packing of a vertex labeled graph* - Marcella Takats,
*An extension of the direction problem* - Hossein Teimoori Faal,
*Weighted Clique Polynomials and Their Applications* - P. G. Tsikouras,
*Mean values and variances for parameters in Dyck paths* - Morimasa Tsuchiya,
*On strict-double-bound numbers of complete graphs missing four edges* - Shoichi Tsuchiya,
*HISTs of triangulations on closed surfaces* - Kazuhiko Ushio,
*Balanced (C_7,C_{8})-Foil Designs and Related Designs* - Vincent Vatter,
*Geometric Grid Classes of Permutations* - Tomáš Vetrík,
*The degree-diameter problem for claw-free graphs and hypergraphs* - Geoff Walsh,
*Completely Regular q-Designs with Small Strength* - Bridget S. Webb,
*Enumerating patterns of tree labellings* - Matthew White,
*The monochromatic circumference of 2-edge-coloured graphs.* - Anders Yeo,
*2-Colorings in k-Regular k-Uniform Hypergraphs* - Hyonju Yu,
*On the limit points of the smallest eigenvalues of regular graphs* - Sanming Zhou,
*Unitary graphs and classification of a family of symmetric graphs with complete quotients* - Michele Zito,
*On the Complexity of the Empire Colouring Problem* - Vadim Zverovich,
*Upper Bounds for the Bondage Number of Graphs on Topological Surfaces*

Back to the British Combinatorial Conferences page.