Brian Alspach

59 papers B 1C 1Journal 55Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Cubic factor-invariant graphs of cycle quotient type - The alternating case.
Eur. J. Comb.
Brian Alspach, Primoz Sparl
2024 J jnl
On the 2-spanning cyclability of honeycomb toroidal graphs.
Discret. Appl. Math.
Brian Alspach, Aditya Joshi
2024 J jnl
On the k-Spanning Cyclability of 4-Valent Cayley Graphs on Abelian Groups.
Ars Comb.
Brian Alspach, Aditya Joshi
2022 J jnl
On factor-invariant graphs with two cycles.
Discret. Math.
Brian Alspach, Ted Dobson, Afsaneh Khodadadpour, Primoz Sparl
2022 J jnl
On the chromatic index of generalized truncations.
Ars Math. Contemp.
Brian Alspach, Aditya Joshi
2021 J jnl
Corrigendum to "Cycle decompositions of
J. Comb. Theory B
Brian Alspach, Heather Jordon
2021 J jnl
Honeycomb Toroidal Graphs.
Bull. ICA
Brian Alspach
2021 J jnl
Some graph theoretical aspects of generalized truncations.
Australas. J Comb.
Brian Alspach, Joshua B. Connor
2020 J jnl
On strongly sequenceable abelian groups.
Art Discret. Appl. Math.
Brian Alspach, Georgina Liversidge
2019 J jnl
On factor-invariant graphs.
Discret. Math.
Brian Alspach, Afsaneh Khodadadpour, Donald L. Kreher
2017 J jnl
The Friedlander-Gordon-Miller conjecture is true.
Australas. J Comb.
Brian Alspach, Donald L. Kreher, Adrián Pastine
2016 J jnl
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem.
Ars Math. Contemp.
Brian Alspach, Darryn E. Bryant, Daniel Horsley, Barbara M. Maenhaut, Victor Scharaschkin
2015 J jnl
Hamilton paths in Cayley graphs on Coxeter groups: I.
Ars Math. Contemp.
Brian Alspach
2015 J jnl
On automorphism groups of graph truncations.
Ars Math. Contemp.
Brian Alspach, Edward Dobson
2013 J jnl
Johnson graphs are Hamilton-connected.
Ars Math. Contemp.
Brian Alspach
2013 J jnl
Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups.
Discret. Math.
Brian Alspach, Cafer Çaliskan, Donald L. Kreher
2013 J jnl
Pancyclicity and Cayley Graphs on Abelian Groups.
J. Graph Theory
Brian Alspach, Theo Bendit, Christopher Maitland
2012 J jnl
Paley graphs have Hamilton decompositions.
Discret. Math.
Brian Alspach, Darryn E. Bryant, Danny Dyer
2012 J jnl
Small 2-coloured path decompositions.
Ars Comb.
Brian Alspach, Danny Dyer, Kathy Heinrich
2010 J jnl
Hamilton paths in Cayley graphs on generalized dihedral groups.
Ars Math. Contemp.
Brian Alspach, C. C. Chen, Matthew Dean
2009 J jnl
Honeycomb toroidal graphs are Cayley graphs.
Inf. Process. Lett.
Brian Alspach, Matthew Dean
2009 J jnl
On the Hamilton connectivity of generalized Petersen graphs.
Discret. Math.
Brian Alspach, Jiping Liu
2009 J jnl
Sweeping graphs with large clique number.
Discret. Math.
Boting Yang, Danny Dyer, Brian Alspach
2008 J jnl
Time constrained graph searching.
Theor. Comput. Sci.
Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
2007 C conf
Arc Searching Digraphs Without Jumping.
COCOA
Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
2007 — conf
Lower Bounds on Edge Searching.
ESCAPE
Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
2004 B conf
Sweeping Graphs with Large Clique Number.
ISAAC
Boting Yang, Danny Dyer, Brian Alspach
2003 — ch.
Algebraic Graph Theory.
Handbook of Graph Theory
Mark Watkins, Brian Alspach, Paul K. Stockmeyer, Krishnaiyan Thulasirarnan, Michael Doob, James G. Oxley
2003 J jnl
Cycle decompositions IV: complete directed graphs and fixed length directed cycles.
J. Comb. Theory A
Brian Alspach, Heather Gavlas, Mateja Sajna, Helen Verrall
2002 J jnl
Enumeration of Cayley graphs and digraph.
Discret. Math.
Brian Alspach, Marni Mishna
2001 J jnl
Cycle Decompositions of K
J. Comb. Theory B
Brian Alspach, Heather Gavlas
2001 J jnl
Hamilton-Connected Cayley Graphs on Hamiltonian Groups.
Eur. J. Comb.
Brian Alspach, Yusheng Qin
1999 J jnl
Elementary Proofs that Z
Eur. J. Comb.
Brian Alspach, Lewis A. Nowitz
1999 J jnl
Self-complementary circulant graphs.
Ars Comb.
Brian Alspach, Joy Morris, V. Vilfred
1996 J jnl
Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups.
SIAM J. Discret. Math.
Brian Alspach, Yi-Ping Liu, Cun-Quan Zhang
1996 J jnl
On a class of Hamiltonian laceable 3-regular graphs.
Discret. Math.
Brian Alspach, C. C. Chen, Kevin McAvaney
1994 J jnl
Nonseparable graphs with a given number of cycles.
J. Graph Theory
Ranko Scepanovic, Gerhard Ringel, Dragan Marusic, Gek Ling Chia, Brian Alspach
1993 J jnl
Cycle covers of cubic multigraphs.
Discret. Math.
Brian Alspach, Cun-Quan Zhang
1992 J jnl
An Introduction to Combinatorics (Alan Slomson).
SIAM Rev.
Brian Alspach
1992 J jnl
Cayley Graphs with Optimal Fault Tolerance.
IEEE Trans. Computers
Brian Alspach
1991 J jnl
Characterization of a class of triangle-free graphs with a certain adjacency property.
J. Graph Theory
Brian Alspach, C. C. Chen, Katherine Heinrich
1991 J jnl
Edge-pancyclic block-intersection graphs.
Discret. Math.
Brian Alspach, Donovan R. Hare
1990 J jnl
Matching designs.
Australas. J Comb.
Brian Alspach, Katherine Heinrich
1990 J jnl
The hamilton spaces of cayley graphs on abelian groups.
Discret. Math.
Brian Alspach, Stephen C. Locke, Dave Witte
1989 J jnl
Lifting Hamilton cycles of quotient graphs.
Discret. Math.
Brian Alspach
1989 J jnl
Paths and cycles in matroid base graphs.
Graphs Comb.
Brian Alspach, Guizhen Liu
1989 J jnl
The Oberwolfach problem and factors of uniform odd length cycles.
J. Comb. Theory A
Brian Alspach, Paul J. Schellenberg, Douglas R. Stinson, David G. Wagner
1986 J jnl
On Hamilton decompositions of prisms over simple 3-polytopes.
Graphs Comb.
Brian Alspach, Moshe Rosenfeld
1985 J jnl
Some observations on the oberwolfach problem.
J. Graph Theory
Brian Alspach, Roland Häggkvist
1984 J jnl
Research problems.
Discret. Math.
Brian Alspach
1983 J jnl
A lower-bound for the number of productions required for a certain class of languages.
Discret. Appl. Math.
Brian Alspach, Peter Eades, Gordon Rose
1983 J jnl
The classification of hamiltonian generalized Petersen graphs.
J. Comb. Theory B
Brian Alspach
1982 J jnl
A 1-factorization of the line graphs of complete graphs.
J. Graph Theory
Brian Alspach
1981 J jnl
A result on Hamiltonian cycles in generalized Petersen graphs.
J. Comb. Theory B
Brian Alspach, Peter J. Robinson, Moshe Rosenfeld
1981 J jnl
Realization of certain generalized paths in tournaments.
Discret. Math.
Brian Alspach, Moshe Rosenfeld
1979 J jnl
Isomorphism of circulant graphs and digraphs.
Discret. Math.
Brian Alspach, Torrence D. Parsons
1978 J jnl
Degree frequencies in digraphs and tournaments.
J. Graph Theory
Brian Alspach, K. B. Reid
1977 J jnl
On embedding triangle-free graphs in unit spheres.
Discret. Math.
Brian Alspach, Moshe Rosenfeld
1975 J jnl
Mutually disjoint families of 0-1 sequences.
Discret. Math.
Brian Alspach, L. T. Ollmann, K. B. Reid