Brian Alspach

Orcid: 0000-0002-1034-3993

Affiliations:
  • Simon Fraser University, Canada


According to our database1, Brian Alspach authored at least 55 papers between 1975 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
On factor-invariant graphs with two cycles.
Discret. Math., 2022

On the chromatic index of generalized truncations.
Ars Math. Contemp., 2022

2021
Corrigendum to "Cycle decompositions of <i>K</i><sub><i>n</i></sub> and <i>K</i><sub><i>n</i></sub> - <i>I</i>" [J. Combin. Theory Ser. B 81 (1) (2001) 77-99].
J. Comb. Theory, Ser. B, 2021

Honeycomb Toroidal Graphs.
Bull. ICA, 2021

Some graph theoretical aspects of generalized truncations.
Australas. J Comb., 2021

2020
On strongly sequenceable abelian groups.
Art Discret. Appl. Math., 2020

2019
On factor-invariant graphs.
Discret. Math., 2019

2017
The Friedlander-Gordon-Miller conjecture is true.
Australas. J Comb., 2017

2016
On factorisations of complete graphs into circulant graphs and the Oberwolfach problem.
Ars Math. Contemp., 2016

2015
On automorphism groups of graph truncations.
Ars Math. Contemp., 2015

Hamilton paths in Cayley graphs on Coxeter groups: I.
Ars Math. Contemp., 2015

2013
Pancyclicity and Cayley Graphs on Abelian Groups.
J. Graph Theory, 2013

Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups.
Discret. Math., 2013

Johnson graphs are Hamilton-connected.
Ars Math. Contemp., 2013

2012
Paley graphs have Hamilton decompositions.
Discret. Math., 2012

Small 2-coloured path decompositions.
Ars Comb., 2012

2010
Hamilton paths in Cayley graphs on generalized dihedral groups.
Ars Math. Contemp., 2010

2009
Honeycomb toroidal graphs are Cayley graphs.
Inf. Process. Lett., 2009

Sweeping graphs with large clique number.
Discret. Math., 2009

On the Hamilton connectivity of generalized Petersen graphs.
Discret. Math., 2009

2008
Time constrained graph searching.
Theor. Comput. Sci., 2008

2007
Lower Bounds on Edge Searching.
Proceedings of the Combinatorics, 2007

Arc Searching Digraphs Without Jumping.
Proceedings of the Combinatorial Optimization and Applications, 2007

2003
Cycle decompositions IV: complete directed graphs and fixed length directed cycles.
J. Comb. Theory, Ser. A, 2003

Algebraic Graph Theory.
Proceedings of the Handbook of Graph Theory., 2003

2002
Enumeration of Cayley graphs and digraph.
Discret. Math., 2002

2001
Cycle Decompositions of K<sub>n</sub> and K<sub>n</sub>-I.
J. Comb. Theory, Ser. B, 2001

Hamilton-Connected Cayley Graphs on Hamiltonian Groups.
Eur. J. Comb., 2001

1999
Elementary Proofs that Z<sub>p</sub><sup>2</sup> and Z<sub>p</sub><sup>3</sup> are CI-groups.
Eur. J. Comb., 1999

Self-complementary circulant graphs.
Ars Comb., 1999

1996
Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups.
SIAM J. Discret. Math., 1996

On a class of Hamiltonian laceable 3-regular graphs.
Discret. Math., 1996

1994
Nonseparable graphs with a given number of cycles.
J. Graph Theory, 1994

1993
Cycle covers of cubic multigraphs.
Discret. Math., 1993

1992
Cayley Graphs with Optimal Fault Tolerance.
IEEE Trans. Computers, 1992

An Introduction to Combinatorics (Alan Slomson).
SIAM Rev., 1992

1991
Characterization of a class of triangle-free graphs with a certain adjacency property.
J. Graph Theory, 1991

Edge-pancyclic block-intersection graphs.
Discret. Math., 1991

1990
The hamilton spaces of cayley graphs on abelian groups.
Discret. Math., 1990

Matching designs.
Australas. J Comb., 1990

1989
The Oberwolfach problem and factors of uniform odd length cycles.
J. Comb. Theory, Ser. A, 1989

Paths and cycles in matroid base graphs.
Graphs Comb., 1989

Lifting Hamilton cycles of quotient graphs.
Discret. Math., 1989

1986
On Hamilton decompositions of prisms over simple 3-polytopes.
Graphs Comb., 1986

1985
Some observations on the oberwolfach problem.
J. Graph Theory, 1985

1984
Research problems.
Discret. Math., 1984

1983
The classification of hamiltonian generalized Petersen graphs.
J. Comb. Theory, Ser. B, 1983

A lower-bound for the number of productions required for a certain class of languages.
Discret. Appl. Math., 1983

1982
A 1-factorization of the line graphs of complete graphs.
J. Graph Theory, 1982

1981
A result on Hamiltonian cycles in generalized Petersen graphs.
J. Comb. Theory, Ser. B, 1981

Realization of certain generalized paths in tournaments.
Discret. Math., 1981

1979
Isomorphism of circulant graphs and digraphs.
Discret. Math., 1979

1978
Degree frequencies in digraphs and tournaments.
J. Graph Theory, 1978

1977
On embedding triangle-free graphs in unit spheres.
Discret. Math., 1977

1975
Mutually disjoint families of 0-1 sequences.
Discret. Math., 1975


  Loading...