Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Alspach, Brian"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Pancyclicity and Cayley graphs on Abelian groups
Brian Alspach
,
Theo Bendit
,
Christopher Maitland
Journal of Graph Theory
74
(3), 2013, pp. 260-274
Honeycomb toroidal graphs are Cayley graphs
Brian Alspach
,
Matthew Dean
Information Processing Letters
109
(13), 2009, pp. 705-708
Time constrained graph searching
Brian Alspach
,
Danny Dyer
,
Denis Hanson
,
Boting Yang
Theoretical Computer Science
399
(3), 2008, pp. 158-168
Sweeping graphs with large clique number
Boting Yang
,
Danny Dyer
,
Brian Alspach
Lecture Notes in Computer Science
3341
, 2004, pp. 908-920
Cycle decompositions IV: Complete directed graphs and fixed length directed cycles
Brian Alspach
,
Heather Gavlas
,
Mateja S̑ajna
,
Helen Verrall
Journal of Combinatorial Theory Series A
103
(1), 2003, pp. 165-208
Cycle decompositions of
K_n
and
K_n-I
Brian Alspach
,
Heather Gavlas
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 77-99
Nowhere-zero 4-flows and Cayley graphs on solvable groups
Brian Alspach
,
Yi-Ping Liu
,
Cun-Quan Zhang
SIAM Journal on Discrete Mathematics
9
(1), 1996, pp. 151-154
Nonseparable graphs with a given number of cycles
Ranko S̑ćepanović
,
Gerhard Ringel
,
Dragan Marus̑ic̑
,
G.L. Chia
,
Brian Alspach
Journal of Graph Theory
18
(8), 1994, pp. 777-789
Characterization of a class of triangle-free graphs with a certain adjacency property
Brian Alspach
,
C.C. Chen
,
Katherine Heinrich
Journal of Graph Theory
15
(4), 1991, pp. 375-388
Paths and cycles in matroid base graphs
Brian Alspach
,
Guizhen Liu
Graphs and Combinatorics
5
, 1989, pp. 207-211
The Oberwolfach problem and factors of uniform odd length cycles
Brian Alspach
,
P.J. Schellenberg
,
D.R. Stinson
,
David Wagner
Journal of Combinatorial Theory Series A
52
, 1989, pp. 20-43
On Hamilton decompositions of prisms over simple 3-polytopes
Brian Alspach
,
Moshe Rosenfeld
Graphs and Combinatorics
2
, 1986, pp. 1-8
Some observations on the Oberwolfach problem
Brian Alspach
,
Roland Häggkvist
Journal of Graph Theory
9
(1), 1985, pp. 177-187
A lower-bound for the number of productions required for a certain class of languages
Brian Alspach
,
Peter Eades
,
Gordon Rose
Discrete Applied Mathematics
6
, 1983, pp. 109-115
The classification of Hamiltonian generalized Petersen graphs
Brian Alspach
Journal of Combinatorial Theory Series B
34
(3), 1983, June, pp. 293-312
A 1-factorization of the line graphs of complete graphs
Brian Alspach
Journal of Graph Theory
6
(4), 1982, pp. 441-445
A result on Hamiltonian cycles in generalized Petersen graphs
Brian Alspach
,
Peter J. Robinson
,
Moshe Rosenfeld
Journal of Combinatorial Theory Series B
31
(2), 1981, October, pp. 225-231
Degree frequencies in digraphs and tournaments
Brian Alspach
,
K.B. Reid
Journal of Graph Theory
2
(3), 1978, pp. 241-249
Path numbers of tournaments
Brian Alspach
,
David W. Mason
,
Norman J. Pullman
Journal of Combinatorial Theory Series B
20
, 1976, pp. 222-228
Mutually disjoint families of 0-1 sequences
Brian Alspach
,
L.T. Ollmann
,
K.B. Reid
Discrete Mathematics
12
, 1975, pp. 205-209
Bypasses in asymmetric digraphs
Brian Alspach
,
K.B. Reid
,
D.P. Roselle
Journal of Combinatorial Theory Series B
17
, 1974, pp. 11-18
Point-symmetric graphs and digraphs of prime order and transitive permutation groups of prime degree
Brian Alspach
Journal of Combinatorial Theory Series B
15
, 1973, pp. 12-17