Brian Alspach (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Brian Alspach" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

2semanticscholar.org

11^th place

8^th place

1mathgenealogy.org

4,501^st place

3,002^nd place

low place

6,461^st place

207^th place

136^th place

1newcastle.edu.au

low place

low place

1books.google.com

3^rd place

3^rd place

69^th place

59^th place

451^st place

277^th place

ams.org

mathscinet.ams.org

Bryant, Darryn; Horsley, Daniel; Pettersson, William (2014). "Cycle decompositions V: Complete graphs into cycles of arbitrary lengths". Proceedings of the London Mathematical Society. Third Series. 108 (5): 1153–1192. arXiv:1204.3709. doi:10.1112/plms/pdt051. MR 3214677. S2CID 40046099.

arxiv.org

Bryant, Darryn; Horsley, Daniel; Pettersson, William (2014). "Cycle decompositions V: Complete graphs into cycles of arbitrary lengths". Proceedings of the London Mathematical Society. Third Series. 108 (5): 1153–1192. arXiv:1204.3709. doi:10.1112/plms/pdt051. MR 3214677. S2CID 40046099.

books.google.com

Alspach, Brian; Parsons, T. D. (1982). "A construction for vertex–transitive graphs". Canadian Journal of Mathematics. 34 (2): 307–318. doi:10.4153/cjm-1982-020-8. S2CID 14128355.

doi.org

Morris, Joy; Šajna, Mateja (2005). "Brian Alspach and his work". Discrete Mathematics. 299 (1–3): 269–287. CiteSeerX 10.1.1.86.8422. doi:10.1016/j.disc.2005.03.024.
Alspach, Brian (June 1967). "Cycles of Each Length in Regular Tournaments". Canadian Mathematical Bulletin. 10 (2): 283–286. doi:10.4153/CMB-1967-028-6.
Alspach, Brian (1973). "Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree". Journal of Combinatorial Theory. Series B. 15 (1): 12–7. doi:10.1016/0095-8956(73)90027-0.
Alspach, Brian; Parsons, T. D. (1979). "Isomorphism of circulant graphs and digraphs". Discrete Mathematics. 25 (2): 97–108. doi:10.1016/0012-365X(79)90011-6.
Alspach, Brian; Parsons, T. D. (1982). "A construction for vertex–transitive graphs". Canadian Journal of Mathematics. 34 (2): 307–318. doi:10.4153/cjm-1982-020-8. S2CID 14128355.
Alspach, B.; Zhang, Cun-Quan (1993), "Cycle covers of cubic multigraphs", Discrete Mathematics, 111 (1–3): 11–17, doi:10.1016/0012-365X(93)90135-G.
Alspach, Brian; Gavlas, Heather (2001). "Cycle Decompositions of Kn and Kn−I". Journal of Combinatorial Theory. Series B. 81: 77–99. doi:10.1006/jctb.2000.1996.
Bryant, Darryn; Horsley, Daniel; Pettersson, William (2014). "Cycle decompositions V: Complete graphs into cycles of arbitrary lengths". Proceedings of the London Mathematical Society. Third Series. 108 (5): 1153–1192. arXiv:1204.3709. doi:10.1112/plms/pdt051. MR 3214677. S2CID 40046099.

mathgenealogy.org

Brian Alspach at the Mathematics Genealogy Project

newcastle.edu.au

"Staff Profile". www.newcastle.edu.au. 2015-01-16. Retrieved 2019-09-12.

psu.edu

citeseerx.ist.psu.edu

Morris, Joy; Šajna, Mateja (2005). "Brian Alspach and his work". Discrete Mathematics. 299 (1–3): 269–287. CiteSeerX 10.1.1.86.8422. doi:10.1016/j.disc.2005.03.024.

semanticscholar.org

api.semanticscholar.org

Alspach, Brian; Parsons, T. D. (1982). "A construction for vertex–transitive graphs". Canadian Journal of Mathematics. 34 (2): 307–318. doi:10.4153/cjm-1982-020-8. S2CID 14128355.
Bryant, Darryn; Horsley, Daniel; Pettersson, William (2014). "Cycle decompositions V: Complete graphs into cycles of arbitrary lengths". Proceedings of the London Mathematical Society. Third Series. 108 (5): 1153–1192. arXiv:1204.3709. doi:10.1112/plms/pdt051. MR 3214677. S2CID 40046099.

uregina.ca

mathcentral.uregina.ca

"Brian Alspach" (PDF). Mathematics with a Human Face: Mathematicians at Work. Math Central, University of Regina. Retrieved 2024-05-16.