Infinite covers of cages (with S.K. Burford). Europ. J. Combinatorics, 6 (1985) 7-12.
Cubic distance-regular graphs (with A.G. Boshier and J. Shawe-Taylor) J. London Math. Soc. (2), 33 (1986) 385-394.
The spectral radius of infinite graphs (with B. Mohar and J. Shawe-Taylor) Bull. London Math. Soc., 20 (1988) 116-120.
Girth and residual finiteness. Combinatorica, 8 (1988) 307-312.
Graphs with large girth. Ars Combinatoria, 25-C (1988) 73-80.
Cubic graphs with large girth. Annals of the New York Academy of Sciences, 555 (1989) 56-62.
Confluence of some presentations associated with graphs. Discrete Math., 75 (1989) 56-62.
A proof of Serre's theorem. Discrete Math., 78 (1989) 55-57.
The growth rate of the harmonious chromatic number (with D. Beane and B.J. Wilson). J. Graph Theory, 13 (1989) 291-299.
Note on the girth of Ramanujan graphs (with A.G. Boshier). J. Combinatorial Theory (B), 49 (1990) 190-194. [Download M1990a]
Some heuristics for graph colouring. In: Graph Colourings (ed. R. Nelson and R.J. Wilson), Pitman Research Notes in Mathematics 218, Longmans (1990) 87-96.
The learnability of formal concepts (with M.H.G. Anthony and J. Shawe-Taylor). Proceedings of the Third Annual Workshop on Computational Learning Theory (COLT 1990), M.A. Fulk (ed.), Morgan-Kaufmann, San Mateo Ca. (1990) 246-257.
Learning algorithms: theory and practice. In: Neural Network Applications (ed. J.G. Taylor), Springer (1992) 1-11.
Theoretical and practical studies of a competitive learning process (with G.R. Brightwell and D. Tsoubelis). Network 3 (1992) 285-301.
A framework for cumulative learning. Mathematics Preprint Series, LSE-MPS-27, London School of Economics, 1992.
Bounding sample size with the Vapnik-Chervonenkis dimension (with M.H.G. Anthony and J. Shawe-Taylor). Discrete Applied Mathematics 42 (1993) 65-73.
The mean chromatic number of paths and cycles (with M.H.G. Anthony). Discrete Mathematics 120 (1993) 227-231.
Computational learning theory for artificial neural networks (with M.H.G. Anthony). In: Mathematical Approaches to Neural Networks (ed. J.G. Taylor), North-Holland (1993) 25-62.
Discrete Mathematics in Finance: Two Applications, Mathematics Preprint Series LSE-MPS- 49, London School of Economics, 1993.
Potential theory on distance-regular graphs. Combinatorics, Probability and Computing 2 (1993) 243-255.
Combinatorics and connectionism. Discrete Math. 124 (1994) 19-36.
Exchange rate networks and mechanisms. Mathematics Preprint Series, LSE-MPS-64, London School of Economics, December 1993, revised May 1994.
PAC learning and artificial neural networks (with M.H.G. Anthony). In: The Handbook of Brain Theory and Neural Networks, (ed. M.A. Arbib), Bradford/MIT Press (1994).
Exchange rates and the matrix-tree theorem. Theoretical Economics Discussion Papers TE/94/273, London School of Economics, 1994.
How to compute the spectral density of a lattice and its quotients. Mathematics Preprint Series, LSE-MPS-74, London School of Economics, October 1994.
The spectral density of covering lattices. Mathematics Preprint Series, LSE-MPS-78, London School of Economics, January 1995.
A computational learning theory view of economic forecasting with neural nets (with M.H.G. Anthony). In: Neural Networks in the Capital Markets (ed.A.Refenes), Wiley (1995) 77-98.
Algorithms for learning and coloring. In: Graph Theory, Combinatorics and Applications, (ed. Y. Alavi and A. Schwenk), Wiley (1995) 63-70.
The potential of potential theory. LSE Mathematics Preprint Series, LSE-MPS-91, September 1995.
Chip-firing on distance-regular graphs. CDAM Research Report Series, LSE-CDAM-96-11, June 1996.
International Finance. In: Graph Connections (ed. L.W. Beineke and R.J. Wilson), Oxford University Press (1997) 261-279.
Chip-firing and the chromatic polynomial (with P. Winkler). CDAM Research Report Series, LSE-CDAM-97-03, February 1997.
Integer programming techniques for the frequency assignment problem. CDAM Research Report Series, LSE-CDAM-97-06, April 1997.
Algebraic potential theory on graphs. Bull. London Math. Soc. 29 (1997) 641-682
Constructions for cubic graphs with large girth. Electronic Journal of Combinatorics 5 (1998) A1. [Download M1998a]
Optimising the signal-to-noise ratio (with D Fon der Flaass). CDAM Research Report Series, LSE-CDAM-98-16, August 1998.
Chip-firing and the critical group of a graph. J. Algebraic Combinatorics, 9 (1999) 25-45.
The Tutte polynomial as a growth function. Journal of Algebraic Combinatorics 10 (1999) 115-133.
The chromatic polynomial of the 3 x n toroidal square lattice. CDAM Research Report Series, LSE-CDAM 99-05, June 1999.
T=0 partition functions for Potts antiferromagnets on square lattice strips with (twisted) periodic boundary conditions (with R.Shrock). J.Phys. A. 32 (1999) L489-L493.
A matrix method for chromatic polynomials – II. CDAM Research Report Series, LSE-CDAM 2000-04, April 2000.
(NB and P.Reinfeld). The chromatic roots of generalised dodecahedra. CDAM Research Report Series, LSE-CDAM 2000-07, June 2000.
Equimodular curves for reducible matrices CDAM Research Report Series, LSE-CDAM 2001-01, January 2001. PDF.
A matrix method for chromatic polynomials. J. Combinatorial Theory (B), 82 (2001) 19-29 [Download M2001b]
Chromatic polynomials for twisted bracelets. Bull. London Math. Soc. 34 (2002) 129-139.
Chromatic polynomials and representations of the symmetric group. Linear Algebra and its Applications 356 (2002) 3-26.