Royal Holloway, University of London, 1-5 July 2013

- E. Abajo,
*On generalized 3-connectivity of the strong graphs* - S. D. Abdullahi,
*Some open problems in computational topology* - M. Abreu,
*Families of bi-regular cages of girth 5* - U. Ahmad,
*Power digraphs of Sophie Germain primes* - H. Ait-Haddadene,
*On the maximum clique number problem of P-graphs* - F. Al Kharousi,
*Combinatorial results for certain semigroups of partial isometries of a finite chain* - K. C. Aman,
*Using cubical arrays to determine the automorphism group of a semifield* - G. Araujo-Pardo,
*On ωψ-Perfect Graphs* - O. Bagdasar,
*On the enumeration of generalised periodic Horadam sequences* - R. F. Bailey,
*On the metric dimension of imprimitive distance-regular graphs* - M. Banaji,
*Some combinatorial problems arising in the study of bio/chemical networks* - D. Bevan,
*Permutation grid classes and the spectra of graphs* - N. Biggs,
*Thoughts on strongly regular graphs* - A. Bonisoli,
*Nordhaus-Gaddum inequalities for the automorphic chromatic index* - S. Bonvicini,
*Classification of Hamiltonian Igraphs* - R. Brignall,
*Forbidding paths and cliques in permutation graphs, and well-quasi-ordering* - I. Broere,
*Hom-properties of graphs and the Hedetniemi Conjecture* - A. Burgess,
*Orthogonally resolvable cycle decompositions* - P. Cameron,
*Synchronization, graph homomorphisms, and combinatorics* - R. M. Casablanca,
*Average connectivity of interconnection networks* - P. Ó Catháin,
*Equivalence of difference sets* - N. J. Cavenagh,
*Decomposing bipartite graphs with high minimum degree into 4-cycles* - G. L. Chia,
*On the skewness of the join of graphs* - C. Chun,
*Inductive tools for handling internally 4-connected binary matroids II* - B. Csajbók,
*Semiarcs with a long secant in PG(2,q)* - P. Dankelmann,
*Diameter and radius in bipartite digraphs* - P. Danziger,
*Bipartite 2-factorisations of complete multipartite graphs* - S. De Winter,
*Automorphisms of strongly regular graphs* - D. Donovan,
*A polynomial embedding for pairs of partial orthogonal latin squares* - C. Dowden,
*Agreement protocols in the presence of a mobile adversary* - K. Edwards,
*Deletion depth, deletion-reduction depth, and the complexity of Max 2-CSP* - M. Ellingham,
*Characterization of K_{2,4}-minor-free graphs* - A. B. Evans,
*On strong complete mappings of finite groups* - B. Fairbairn,
*A model of computer memory* - S. Fujita,
*Forbidden rainbow subgraphs that force large highly connected monochromatic subgraphs* - A. Gagarin,
*Embedding graphs containing K_5-subdivisions on the torus* - N. Georgiou,
*Modular decomposition and the Reconstruction Conjecture* - M. Grannell,
*The number of transversal designs* - G. R. W. Greaves,
*On limit points of the least eigenvalue graph* - T. S. Griggs,
*Representing graphs in Steiner triple systems* - S. M. Hegde,
*A proof of harmonious tree conjecture* - A. J. W. Hilton,
*Some theorems and conjectures about extremal finite set structures* - D. Horsley,
*Another family of Steiner triple systems without almost parallel classes* - J. Hou,
*Some topics on edge decomposition of graphs* - F. Kaci,
*Order-interval hypergraph of the N-free poset* - R. Kheffache,
*An approximation algorithm for metric TSP and optimally connected* - K. Kimura,
*Offensive alliances in trees* - N. Korpelainen,
*Linear clique-width for subclasses of cographs, with connections to permutations* - A. R. Kozlik,
*Triple systems and binary operations* - D. Král',
*Finitely forcible permutation limits* - M. Krzywkowski,
*On trees with double domination number equal to 2-domination number plus one* - J. Kyppö,
*The arithmetical n-polytope and the multinomial theorem* - D. Labbate,
*A characterization of odd 2-factor snarks* - S. Lacy,
*Looking glass neofields* - C. Lai,
*Some open problems on cycles* - F. Lazebnik,
*Embedding cycles in finite planes* - F. Lehner,
*Stabilisers of random colourings in subdegree finite permutation groups* - V. E. Levit,
*On f-symmetries of independence polynomials* - Q. Lin,
*Multicolor bipartite Ramsey number of C_4 and large K_{n,n}* - G. López Chávez,
*On biregular cages of girth 8* - G. Lovegrove,
*Maximizing the number of Pasch configurations Steiner triple system* - V. V. Lozin,
*On factorial properties of graphs* - L. Mach,
*A new lower bound based on Gromov's method of selecting heavily covered points* - K. Markström,
*Shortest cycle covers of cubic cyclically 4-edge connected graphs* - W. J. Martin,
*The Q-ideal of the Fano Plane* - D. Mayhew,
*Is the missing axiom of matroid theory lost forever?* - T. A. McCourt,
*Doubly even orientable closed 2-cell embeddings of the complete graph* - A. McDowell,
*Non-vertex balanced factors in random graphs* - K. E. Mellinger,
*Minimal Kakeya sets* - I. Moatt,
*A Penrose polynomial for graphs in surfaces* - J. Moori,
*On the automorphisms of designs constructed from finite simple groups* - M. J. Morgan,
*A bound on the degree distance topological index* - E. G. Mphako-Banda,
*Some χ-equivalent and χ-unique matroids representable over a group* - A. O. Munagi,
*Some inplace identities for integer compositions* - V. Napolitano,
*On sets of type (q+1,n)_2 in PG(3,q)* - M. Newman,
*On sixth-root-of-unity matroids* - T. Nixon,
*Constructing periodically rigid frameworks in the plane* - S. D. Noble,
*Bounds on real zeros of the characteristic polynomial of matroids of bounded branch-width* - J. Oxley,
*Inductive tools for handling internally 4-connected binary matroids I* - S. Pasotti,
*Loops, regular permutation sets and colouring of directed graphs* - A. Pasotti,
*On the problem of Buratti, Horak and Rosa* - M. B. Paterson,
*A simplified combinatorial treatment of constructions and threshold gaps of ramp schemes* - I. M. Pelayo,
*Global locating domination in bipartite graphs* - D. B. Penman,
*Sets with more restricted sums than differences* - D. Pike,
*Cyclic extensions in block-intersection graphs of pairwise balanced designs* - A. Rajkumar,
*Bounds on the simple graph and multigraph (r,s,a,t)-threshold numbers* - S. Rajola,
*A new way to construct hyperovals in finite Desarguesian planes* - A. Rattan,
*Products of long cycles and small cycle dependence* - E. Rivera-Campo,
*A class of odd-graceful trees* - P. Rowlinson,
*Star complements and connectivity in finite graphs* - F. Ruskey,
*Nested recurrence relations with morphic interpretations* - C. G. Rutherford,
*Pancyclicity when each cycle must pass exactly k Hamilton cycle chords* - A. Saito,
*Precoloring extension involving pairs of vertices of small distance* - J. Salas,
*Constructions of small regular graphs of girth 7* - R. Simanjuntak,
*Metric dimension of amalgamation of graphs* - P. Tsikouras,
*Counting nonleft peaks in Dyck paths* - H. Ulfarsson,
*Planar maps, β(1, 0)-trees and pattern avoiding permutations* - I. M. Wanless,
*Group embeddings of spherical latin trades* - P. N. Withers,
*Uniform multicommodity flow in complete multipartite graphs with random edge capacities* - T. Wu,
*On the degree distribution of large networks generated by the partial duplication model* - S. Zhang,
*Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs* - V. Zverovich,
*Braess' Paradox in a generalised traffic network*

Back to the British Combinatorial Conferences page.