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
Hilfe
Suche: Author="Bryant, Darryn E."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Erratum to ''Star factorizations of graph products''
Darryn E. Bryant
,
Saad I. El-Zanati
,
Charles Vanden Eynden
Journal of Graph Theory
54
(1), 2007, pp. 88-89
On the Hamilton-Waterloo problem
Peter Adams
,
Elizabeth J. Billington
,
Darryn E. Bryant
,
Saad I. El-Zanati
Graphs and Combinatorics
18
(1), 2002, pp. 31-51
Star decompositions of cubes
Darryn E. Bryant
,
Saad El-Zanati
,
Charles Vanden Eynden
,
Dean G. Hoffman
Graphs and Combinatorics
17
(1), 2001, pp. 55-59
Star factorizations of graph products
Darryn E. Bryant
,
Saad I. El-Zanati
,
Charles Vanden Eynden
Journal of Graph Theory
36
(2), 2001, pp. 59-66
On the Oberwolfach problem with two similar length cycles
Darryn E. Bryant
Graphs and Combinatorics
17
(2), 2001, pp. 199-206
Maximal sets of Hamilton cycles in
K_{n,n}
Darryn E. Bryant
,
S. El-Zanati
,
C.A. Rodger
Journal of Graph Theory
33
(1), 2000, pp. 25-31
d
-cube decompositons of
K_n\K_m
Peter Adams
,
Darryn E. Bryant
,
Saad I. El-Zanati
,
Charles Vanden Eynden
Graphs and Combinatorics
13
, 1997, pp. 1-7
d
-cube decompositons of
K_n \backslash K_m
Peter Adams
,
Darryn E. Bryant
,
Saad I. El-Zanati
,
Charles Vanden Eynden
Graphs and Combinatorics
13
, 1997, pp. 1-7
2m
-cycle systems of
K_{2m+1}\C_m
Darryn E. Bryant
Graphs and Combinatorics
13
, 1997, pp. 227-229
2m
-cycle systems of
K_{2m+1} \backslash C_m
Darryn E. Bryant
Graphs and Combinatorics
13
, 1997, pp. 227-229
The spectrum problem for the Petersen graph
Peter Adams
,
Darryn E. Bryant
Journal of Graph Theory
22
(2), 1996, pp. 175-180
Decomposing the complete graph into cycles of many lengths
Darryn E. Bryant
,
Peter Adams
Graphs and Combinatorics
11
, 1995, pp. 97-102
The Doyen-Wilson theorem extended to 5-cycles
Darryn E. Bryant
,
C.A. Rodger
Journal of Combinatorial Theory Series A
68
(1), 1994, pp. 218-225