|
Search the dblp DataBase
Brian Alspach:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Boting Yang, Danny Dyer, Brian Alspach
Sweeping Graphs with Large Clique Number. [Citation Graph (0, 0)][DBLP] ISAAC, 2004, pp:908-920 [Conf]
- Brian Alspach, Joy Morris, V. Vilfred
Self-complementary circulant graphs. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:53, n:, pp:- [Journal]
- Brian Alspach, Marni Mishna
Enumeration of Cayley graphs and digraph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:256, n:3, pp:527-539 [Journal]
- Brian Alspach, Lewis A. Nowitz
Elementary Proofs that Zp2 and Zp3 are CI-groups. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 1999, v:20, n:7, pp:607-617 [Journal]
- Brian Alspach, Yusheng Qin
Hamilton-Connected Cayley Graphs on Hamiltonian Groups. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2001, v:22, n:6, pp:777-787 [Journal]
- Brian Alspach
The classification of hamiltonian generalized Petersen graphs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1983, v:34, n:3, pp:293-312 [Journal]
- Brian Alspach, Heather Gavlas
Cycle Decompositions of Kn and Kn-I. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:77-99 [Journal]
- Brian Alspach, Heather Gavlas, Mateja Sajna, Helen Verrall
Cycle decompositions IV: complete directed graphs and fixed length directed cycles. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2003, v:103, n:1, pp:165-208 [Journal]
- Brian Alspach, Paul J. Schellenberg, Douglas R. Stinson, David Wagner
The Oberwolfach problem and factors of uniform odd length cycles. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1989, v:52, n:1, pp:20-43 [Journal]
- Brian Alspach, Yi-Ping Liu, Cun-Quan Zhang
Nowhere-Zero 4-Flows and Cayley Graphs on Solvable Groups. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1996, v:9, n:1, pp:151-154 [Journal]
- Brian Alspach
Cayley Graphs with Optimal Fault Tolerance. [Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1992, v:41, n:10, pp:1337-1339 [Journal]
- Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
Arc Searching Digraphs Without Jumping. [Citation Graph (0, 0)][DBLP] COCOA, 2007, pp:354-365 [Conf]
- Brian Alspach, Danny Dyer, Denis Hanson, Boting Yang
Lower Bounds on Edge Searching. [Citation Graph (0, 0)][DBLP] ESCAPE, 2007, pp:516-527 [Conf]
- Brian Alspach, Moshe Rosenfeld
Realization of certain generalized paths in tournaments. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1981, v:34, n:2, pp:199-202 [Journal]
- Brian Alspach
Research problems. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1984, v:49, n:2, pp:219- [Journal]
- Brian Alspach
Lifting Hamilton cycles of quotient graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1989, v:78, n:1-2, pp:25-36 [Journal]
- Brian Alspach, Stephen C. Locke, Dave Witte
The hamilton spaces of cayley graphs on abelian groups. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1990, v:82, n:2, pp:113-126 [Journal]
- Brian Alspach, Donovan R. Hare
Edge-pancyclic block-intersection graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:97, n:1-3, pp:17-24 [Journal]
- Brian Alspach, Cun-Quan Zhang
Cycle covers of cubic multigraphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1993, v:111, n:1-3, pp:11-17 [Journal]
- Brian Alspach, C. C. Chen, Kevin McAvaney
On a class of Hamiltonian laceable 3-regular graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:151, n:1-3, pp:19-38 [Journal]
Sweeping graphs with large clique number. [Citation Graph (, )][DBLP]
On the Hamilton connectivity of generalized Petersen graphs. [Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs
|