default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrian Alspach
Person information
- affiliation: Simon Fraser University, Canada
- award (2014): Euler Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j54]Brian Alspach
, Aditya Joshi:
On the 2-spanning cyclability of honeycomb toroidal graphs. Discret. Appl. Math. 359: 1-9 (2024)- [j53]Brian Alspach, Primoz Sparl:
Cubic factor-invariant graphs of cycle quotient type - The alternating case. Eur. J. Comb. 120: 103964 (2024) - 2022
- [j52]Brian Alspach, Aditya Joshi:
On the chromatic index of generalized truncations. Ars Math. Contemp. 22(3): 3 (2022) - [j51]Brian Alspach, Ted Dobson, Afsaneh Khodadadpour, Primoz Sparl:
On factor-invariant graphs with two cycles. Discret. Math. 345(8): 112937 (2022) - 2021
- [j50]Brian Alspach, Joshua B. Connor:
Some graph theoretical aspects of generalized truncations. Australas. J Comb. 79: 476-494 (2021) - [j49]Brian Alspach:
Honeycomb Toroidal Graphs. Bull. ICA 91: 94-114 (2021) - [j48]Brian Alspach, Heather Jordon:
Corrigendum to "Cycle decompositions of Kn and Kn - I" [J. Combin. Theory Ser. B 81 (1) (2001) 77-99]. J. Comb. Theory B 146: 532-533 (2021) - 2020
- [j47]Brian Alspach, Georgina Liversidge:
On strongly sequenceable abelian groups. Art Discret. Appl. Math. 3(1) (2020) - 2019
- [j46]Brian Alspach, Afsaneh Khodadadpour, Donald L. Kreher:
On factor-invariant graphs. Discret. Math. 342(8): 2173-2178 (2019) - 2017
- [j45]Brian Alspach, Donald L. Kreher, Adrián Pastine:
The Friedlander-Gordon-Miller conjecture is true. Australas. J Comb. 67: 11-24 (2017) - 2016
- [j44]Brian Alspach, Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin:
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem. Ars Math. Contemp. 11(1): 157-173 (2016) - 2015
- [j43]Brian Alspach:
Hamilton paths in Cayley graphs on Coxeter groups: I. Ars Math. Contemp. 8(1): 35-53 (2015) - [j42]Brian Alspach, Edward Dobson:
On automorphism groups of graph truncations. Ars Math. Contemp. 8(1): 215-223 (2015) - 2013
- [j41]Brian Alspach:
Johnson graphs are Hamilton-connected. Ars Math. Contemp. 6(1): 21-23 (2013) - [j40]Brian Alspach, Cafer Çaliskan, Donald L. Kreher:
Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups. Discret. Math. 313(13): 1475-1489 (2013) - [j39]Brian Alspach, Theo Bendit, Christopher Maitland:
Pancyclicity and Cayley Graphs on Abelian Groups. J. Graph Theory 74(3): 260-274 (2013) - 2012
- [j38]Brian Alspach, Danny Dyer, Kathy Heinrich:
Small 2-coloured path decompositions. Ars Comb. 103: 279-288 (2012) - [j37]Brian Alspach, Darryn E. Bryant, Danny Dyer:
Paley graphs have Hamilton decompositions. Discret. Math. 312(1): 113-118 (2012) - 2010
- [j36]Brian Alspach, C. C. Chen, Matthew Dean:
Hamilton paths in Cayley graphs on generalized dihedral groups. Ars Math. Contemp. 3(1): 29-47 (2010) - 2009
- [j35]Brian Alspach, Jiping Liu:
On the Hamilton connectivity of generalized Petersen graphs. Discret. Math. 309(17): 5461-5473 (2009) - [j34]Boting Yang, Danny Dyer, Brian Alspach:
Sweeping graphs with large clique number. Discret. Math. 309(18): 5770-5780 (2009) - [j33]Brian Alspach, Matthew Dean:
Honeycomb toroidal graphs are Cayley graphs. Inf. Process. Lett. 109(13): 705-708 (2009) - 2008
- [j32]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Time constrained graph searching. Theor. Comput. Sci. 399(3): 158-168 (2008) - 2003
- [j31]Brian Alspach, Heather Gavlas, Mateja Sajna, Helen Verrall:
Cycle decompositions IV: complete directed graphs and fixed length directed cycles. J. Comb. Theory A 103(1): 165-208 (2003) - 2002
- [j30]Brian Alspach, Marni Mishna:
Enumeration of Cayley graphs and digraph. Discret. Math. 256(3): 527-539 (2002) - 2001
- [j29]Brian Alspach, Yusheng Qin:
Hamilton-Connected Cayley Graphs on Hamiltonian Groups. Eur. J. Comb. 22(6): 777-787 (2001) - [j28]Brian Alspach, Heather Gavlas:
Cycle Decompositions of Kn and Kn-I. J. Comb. Theory B 81(1): 77-99 (2001) - 1999
- [j27]Brian Alspach, Joy Morris, V. Vilfred:
Self-complementary circulant graphs. Ars Comb. 53 (1999) - [j26]Brian Alspach, Lewis A. Nowitz:
Elementary Proofs that Zp2 and Zp3 are CI-groups. Eur. J. Comb. 20(7): 607-617 (1999) - 1996
- [j25]Brian Alspach, C. C. Chen, Kevin McAvaney:
On a class of Hamiltonian laceable 3-regular graphs. Discret. Math. 151(1-3): 19-38 (1996) - [j24]Brian Alspach, Yi-Ping Liu, Cun-Quan Zhang:
Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups. SIAM J. Discret. Math. 9(1): 151-154 (1996) - 1994
- [j23]Ranko Scepanovic, Gerhard Ringel, Dragan Marusic, Gek Ling Chia, Brian Alspach:
Nonseparable graphs with a given number of cycles. J. Graph Theory 18(8): 777-789 (1994) - 1993
- [j22]Brian Alspach, Cun-Quan Zhang:
Cycle covers of cubic multigraphs. Discret. Math. 111(1-3): 11-17 (1993) - 1992
- [j21]Brian Alspach:
An Introduction to Combinatorics (Alan Slomson). SIAM Rev. 34(4): 662 (1992) - [j20]Brian Alspach:
Cayley Graphs with Optimal Fault Tolerance. IEEE Trans. Computers 41(10): 1337-1339 (1992) - 1991
- [j19]Brian Alspach, Donovan R. Hare:
Edge-pancyclic block-intersection graphs. Discret. Math. 97(1-3): 17-24 (1991) - [j18]Brian Alspach, C. C. Chen, Katherine Heinrich:
Characterization of a class of triangle-free graphs with a certain adjacency property. J. Graph Theory 15(4): 375-388 (1991) - 1990
- [j17]Brian Alspach, Katherine Heinrich:
Matching designs. Australas. J Comb. 2: 39-56 (1990) - [j16]Brian Alspach, Stephen C. Locke, Dave Witte:
The hamilton spaces of cayley graphs on abelian groups. Discret. Math. 82(2): 113-126 (1990) - 1989
- [j15]Brian Alspach:
Lifting Hamilton cycles of quotient graphs. Discret. Math. 78(1-2): 25-36 (1989) - [j14]Brian Alspach, Guizhen Liu:
Paths and cycles in matroid base graphs. Graphs Comb. 5(1): 207-211 (1989) - [j13]Brian Alspach, Paul J. Schellenberg, Douglas R. Stinson, David G. Wagner:
The Oberwolfach problem and factors of uniform odd length cycles. J. Comb. Theory A 52(1): 20-43 (1989) - 1986
- [j12]Brian Alspach, Moshe Rosenfeld:
On Hamilton decompositions of prisms over simple 3-polytopes. Graphs Comb. 2(1): 1-8 (1986) - 1985
- [j11]Brian Alspach, Roland Häggkvist:
Some observations on the oberwolfach problem. J. Graph Theory 9(1): 177-187 (1985) - 1984
- [j10]Brian Alspach:
Research problems. Discret. Math. 49(2): 219 (1984) - 1983
- [j9]Brian Alspach, Peter Eades, Gordon Rose:
A lower-bound for the number of productions required for a certain class of languages. Discret. Appl. Math. 6(2): 109-115 (1983) - [j8]Brian Alspach:
The classification of hamiltonian generalized Petersen graphs. J. Comb. Theory B 34(3): 293-312 (1983) - 1982
- [j7]Brian Alspach:
A 1-factorization of the line graphs of complete graphs. J. Graph Theory 6(4): 441-445 (1982) - 1981
- [j6]Brian Alspach, Moshe Rosenfeld:
Realization of certain generalized paths in tournaments. Discret. Math. 34(2): 199-202 (1981) - [j5]Brian Alspach, Peter J. Robinson, Moshe Rosenfeld:
A result on Hamiltonian cycles in generalized Petersen graphs. J. Comb. Theory B 31(2): 225-231 (1981) - 1979
- [j4]Brian Alspach, Torrence D. Parsons:
Isomorphism of circulant graphs and digraphs. Discret. Math. 25(2): 97-108 (1979) - 1978
- [j3]Brian Alspach, K. B. Reid:
Degree frequencies in digraphs and tournaments. J. Graph Theory 2(3): 241-249 (1978) - 1977
- [j2]Brian Alspach, Moshe Rosenfeld:
On embedding triangle-free graphs in unit spheres. Discret. Math. 19(2): 103-111 (1977) - 1975
- [j1]Brian Alspach, L. T. Ollmann, K. B. Reid:
Mutually disjoint families of 0-1 sequences. Discret. Math. 12(3): 205-209 (1975)
Conference and Workshop Papers
- 2007
- [c3]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Arc Searching Digraphs Without Jumping. COCOA 2007: 354-365 - [c2]Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang:
Lower Bounds on Edge Searching. ESCAPE 2007: 516-527 - 2004
- [c1]Boting Yang, Danny Dyer, Brian Alspach:
Sweeping Graphs with Large Clique Number. ISAAC 2004: 908-920
Parts in Books or Collections
- 2003
- [p1]Mark Watkins, Brian Alspach, Paul K. Stockmeyer, Krishnaiyan Thulasirarnan, Michael Doob, James G. Oxley:
Algebraic Graph Theory. Handbook of Graph Theory 2003: 484-609
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:46 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
