Below is my list of research publications in mathematics. If you would like a hard copy of any item from the list, please send me an e-mail message.

1. Brian Alspach, Cycles of each length in regular tournaments, Canad. Math. Bull. 10 (1967), 283-286.
2. Brian Alspach, M. Goldberg and J. W. Moon, The group of the composition of two tournaments, Math. Mag. 41 (1968), 77-80.
3. Brian Alspach, A combinatorial proof of a conjecture of Goldberg and Moon, Canad. Math. Bull. 11 (1968), 655-661.
4. Brian Alspach, On point-symmetric tournaments, Canad. Math. Bull. 13 (1970), 317-323.
5. Brian Alspach and J. L. Berggren, On the determination of the maximum order of the group of a tournament, Canad. Math. Bull. 16 (1973), 11-14.
6. Brian Alspach, The groups of point-symmetric graphs and digraphs of prime order, Proc. Third Southeastern Conf. Combin., Graph Theory and Computing, 1972, 23-26.
7. Brian Alspach, Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree, J. Combin. Theory Ser. B 15 (1973), 12-17.
8. Brian Alspach, A characterization of finite 2^*-transitive permutation groups, Proc. Fourth Southeastern Conf. Combin., Graph Theory and Computing, 1973, 131-133.
9. Brian Alspach, K. B. Reid and D. P. Roselle, Bypasses in assymmetric digraphs, J. Combin. Theory Ser. B 17 (1974), 11-18.
10. Brian R. Alspach and N. J. Pullman, Path decompositions of digraphs, Bull. Austral. Math. Soc. 10 (1974), 421-427.
11. Brian Alspach, On constructing the graphs with a given permutation group as their group, Proc. Fifth Southeastern Conf. Combin., Graph Theory and Computing, 1974, 187-208.
12. Brian Alspach, L. T. Ollman and K. B. Reid, Mutually disjoint families of 0-1 sequences, Discrete Math. 12 (1975), 205-209.
13. Brian Alspach, D. Mason and N. J. Pullman, Path numbers of tournaments, J. Combin. Theory Ser. B 20 (1976), 222-228.
14. Brian Alspach, T. C. Brown and Pavol Hell, On the density of sets containing no k-element arithmetic progressions of a certain kind, J. London Math. Soc. (2) 13 (1976), 226-234.
15. Brian Alspach and S. Aronoff, Enumeration of structural isomers in alicyclic hydrocarbons and in porphyrins, Canad. J. Chem. 55 (1977), 2773-2777.
16. Brian Alspach and Moshe Rosenfeld, On embedding triange-free graphs in unit spheres, Discrete Math. 19 (1977), 103-111.
17. Brian Alspach and K. B. Reid, Degree frequencies in digraphs and tournaments, J. Graph Theory 2 (1978), 241-249.
18. Brian Alspach and T. D. Parsons, Isomorphism of circulant graphs and digraphs, Discrete Math. 25 (1979), 97-108.
19. Brian Alspach and Richard J. Sutcliffe, Vertex-transitive graphs of order 2p, Ann. N. Y. Acad. Sci. 319 (1979), 18-27.
20. Brian Alspach, Graphs and permutation groups whose transitive constituents have prime degree, Ann. N. Y. Acad. Sci. 328 (1979), 12-20.
21. Brian Alspach, Katherine Heinrich and Badri N. Varma, Decompositions of complete symmetric digraphs into the oriented pentagons, J. Austral. Math. Soc. Ser. A 28 (1979), 353-361.
22. Brian Alspach, Hamiltonian cycles in vertex-transitive graphs of order 2p, sl Congressus Num. XXIII, Proc. Tenth Southeastern Conf. Combin., Graph Theory and Computing, Utilitas Math., Winnipeg, 1979, 131-140.
23. Brian Alspach, Hamiltonian partitions of vertex-transitive graphs of order 2p, Congressus Num. XXVIII, Proc. Eleventh Southeastern Conf. Combin., Graph Theory and Computing, Utilitas Math., Winnipeg, 1980, 217-221.
24. Brian Alspach and Badri N. Varma, Decomposing complete graphs into cycles of length 2p^e, Ann. Discrete Math. 9 (1980), 155-162.
25. Brian Alspach and Moshe Rosenfeld, Realization of certain generalized paths in tournaments, Discrete Math. 34 (1981), 199-202.
26. Brian Alspach and Katherine Heinrich, Perfect magic cubes of order 4m, Fibonacci Quart. 19 (1981), 97-106.
27. Brian Alspach, Peter J. Robinson and Moshe Rosenfeld, A result on hamiltonian cycles in generalized Petersen graphs, J. Combin. Theory Ser. B 31 (1981), 225-231.
28. Brian Alspach, Katherine Heinrich and Moshe Rosenfeld, Edge partitions of the complete symmetric directed graph and related designs, Israel J. Math. 40 (1981), 118-128.
29. Brian Alspach, The search for long paths and cycles in vertex-transitive graphs and digraphs, in Combinatorial Mathematics VIII (ed. Kevin L. McAvaney), Lecture Notes in Mathematics 884, Springer-Verlag, Berlin, 1981, 14-22.
30. Brian Alspach and T. D. Parsons, A construction for vertex-transitive graphs, Canad. J. Math. 34 (1982), 307-318.
31. Brian Alspach and T. D. Parsons, On hamiltonian cycles in metacirculant graphs, Ann. Discrete Math. 15 (1982), 1-7
32. Brian Alspach and Claudette Tabib, A note on the number of 4-circuits in a tournament, Ann. Discrete Math. 12 (1982), 13-19.
33. Brian Alspach, A 1-factorization of the line graphs of complete graphs, J. Graph Theory 6 (1982), 441-445.
34. Brian Alspach, Peter Eades and Gordon Rose, A lower bound for the number of productions required for a certain class of languages, Discrete Applied Math. 6 (1983), 109-115.
35. Brian Alspach, The classification of hamiltonian generalized Petersen graphs, J. Combin. Theory Ser. B 34 (1983), 293-312.
36. Brian Alspach and Katherine Heinrich, Some Ramsey numbers for families of cycles, Studia Sci. Math. Hungar. 17 (1982), 331-333.
37. Brian Alspach and Roland Häggkvist, Some observations on the Oberwolfach problem, J. Graph Theory 9 (1985), 177-187.
38. Brian Alspach, Erich Durnberger and T. D. Parsons, Hamilton cycles in metacirculant graphs with prime cardinality blocks, Ann. Discrete Math. 27 (1985), 27-34.
39. Brian Alspach and Moshe Rosenfeld, On Hamilton decompositions of prisms over simple 3-polytopes, Graphs Combin. 2 (1986), 1-8.
40. Brian Alspach, Martin Gerson, Gena Hahn and Pavol Hell, On sub-Ramsey numbers, Ars Combin. 22 (1986), 199-206.
41. Brian Alspach, Hamilton cycles in metacirculant graphs with prime power cardinal blocks, Ann. Discrete Math. 41 (1989), 7-16.
42. Brian Alspach, P. J. Schellenberg, D. R. Stinson and David Wagner, The Oberwolfach problem and factors of uniform odd length cycles, J. Combin. Theory Ser. A 52 (1989), 20-43.
43. Brian Alspach, Lifting Hamilton cycles of quotient graphs, Discrete Math. 78 (1989), 25-36.
44. Brian Alspach and Guizhen Liu, Paths and cycles in matroid base graphs, Graphs Combin. 5 (1989), 207-211.
45. Brian Alspach, Jean-Claude Bermond and Dominique Sotteau, Decomposition into cycles I: Hamilton decompositions, in Cycles and Rays (eds. Gena Hahn, Gert Sabidussi and Robert Woodrow), Kluwer, Dordrecht, 1990, 9-18.
46. Brian Alspach and Cun-Quan Zhang, Hamilton cycles in cubic Cayley graphs on dihedral groups, Ars Combin. 28 (1989), 101-108.
47. Brian Alspach, Stephen C. Locke and David Witte, The Hamilton spaces of Cayley graphs on abelian groups, Discrete Math. 82 (1990), 113-126.
48. Brian Alspach and John C. George, One-factorizations of tensor products of graphs, in Topics in Combinatorics and Graph Theory (eds. R. Bodendiek and R. Henn), Physica-Verlag, Heidelberg, 1990, 41-46.
49. Brian Alspach, Katherine Heinrich and Bojan Mohar, A note on Hamilton cycles in block-intersection graphs, in Finite Geometries and Combinatorial Designs (eds. E. S. Kramer and S. S. Magliveras), Contemporary Math. 111 (1990), 1-4.
50. Brian Alspach and Katherine Heinrich, Matching designs, Australasian J. Combin. 2 (1990), 39-55.
51. Brian Alspach and Wang Zhijian, a note on the amida number of a regular graph, J. Combin. Math. Combin. Comp. 9 (1991), 175-178.
52. Brian Alspach, C. C. Chen and Katherine Heinrich, Characterization of a class of triangle-free graphs with a certain adjacency property, J. Graph Theory 15 (1991), 375-388.
53. Brian Alspach and Donovan Hare, Edge-pancyclic block-intersection graphs, Discrete Math. 97 (1991), 17-24.
54. Liu Guizhen, Brian Alspach and Katherine Heinrich, Some results on orthogonal factorizations (in Chinese), Advances Math. 21 (1992), 211-215.
55. Brian Alspach, Katherine Heinrich and Guizhen Liu, Orthogonal factorizations of graphs, in Contemporary Design Theory: A Collection of Surveys (eds. J. Dinitz and D. Stinson), Wiley, New York, 1992, 13-40.
56. Brian Alspach, Cayley graphs with optimal fault tolerance, IEEE Trans. Comput. 41 (1992), 1337-1339.
57. Brian Alspach and Cun-Quan Zhang, Cycle covers of cubic multigraphs, Discrete Math. 111 (1993), 11-17.
58. Brian Alspach, Dragan Marusic and Lewis Nowitz, Constructing graphs which are 1/2-transitive, J. Austral. Math. Soc. Ser. A 56 (1994), 391-402.
59. Brian Alspach, Luis Goddyn and Cun-Quan Zhang, Graphs with the circuit cover property, Trans. Amer. Math. Soc. 344 (1994), 131-154.
60. Brian Alspach, C. C. Chen and Kevin McAvaney, On a class of Hamiltonian laceable 3-regular graphs, Discrete Math. 151 (1996), 19-38.
61. Brian Alspach and Ming-Yao Xu, 1/2-transitive graphs of order 3p, J. Alg. Combin. 3 (1994), 347-355.
62. Brian Alspach and Susan Marshall, Even cycle decompositions of complete graphs minus a 1-factor, J. Combin. Designs 6 (1994), 441-458.
63. Ranko Scepanovic, Gerhard Ringel, Dragan Marusic, G. L. Chia and Brian Alspach, Nonseparable graphs with a given number of cycles, J. Graph Theory 18 (1994), 777-789.
64. Brian Alspach, Marston D. E. Conder, Dragan Marusic and Ming-Yao Xu, A classification of 2-arc-transitive circulants, J. Alg. Combin., 5 (1996), 83-86.
65. Brian Alspach, Yi-Ping Liu and Cun-Quan Zhang, Nowhere-zero 4-flows and Cayley graphs on solvable groups, SIAM J. Discrete Math., 9 (1996), 151-154.
66. Brian Alspach, The Oberwolfach problem, in The CRC Handbook of Combinatorial Designs (C. Colbourn and J. Dinitz, eds.), CRC Press, Boca Raton, 1996, 394-395.
67. Brian Alspach, Isomorphism and Cayley graphs on abelian groups, in Graph Symmetry, (G. Hahn and G. Sabidussi, eds.) Kluwer, Dordrecht, 1997, 1-22.
68. Brian Alspach, Joy Morris and V. Vilfred, Self-complementary circulant graphs, Ars Combinatoria, 53 (1999), 187-191.
69. Brian Alspach and Yusheng Qin, Hamilton-connected Cayley graphs on hamiltonian groups, European J. Combin., 22 (2001), 777-787.
70. Brian Alspach and Lewis A. Nowitz, Elementary proofs that Z_p² and Z_p³ are CI-groups, European J. Combin., 20 (1999), 607-617.
71. Brian Alspach and Heather Gavlas, Cycle decompositions of K_n and K_n - I, J. Combin. Theory Ser. B, 81 (2001), 77-99.
72. Brian Alspach and Marni Mishna, Enumeration of Cayley graphs and digraphs, Discrete Math., 256 (2002), 527-539.
73. Brian Alspach and Shaofei Du, Suborbit structure of permutation p-groups and an application to Cayley digraph isomorphism, Canad. Math. Bull, to appear.
74. Brian Alspach, Heather Gavlas, Mateja Sajna and Helen Verrall, Cycle decompositions IV: Complete directed graphs and fixed length directed cycles, J. Combin. Theory Ser. A, 103 (2003), 165-208.
75. Brian Alspach, Cayley Graphs, in Topics in Algebraic Graph Theory, (L. Beineke and R. Wilson, eds.) Cambridge University Press, London, to appear.
76. Brian Alspach, Cayley Graphs, in Handbook of Graph Theory, (J. Gross and J. Yellen, eds.) CRC Press, Boca Raton, 2004, 505-515.
77. Brian Alspach, Denis Hanson and Xiangwen Li, Pursuit-evasion in Cayley graphs on dihedral groups, Discrete Appl. Math., submitted.