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="Bollob{\'{a}}s, B."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least
k
B. Bollobás
,
C. Cooper
,
T.I. Fenner
,
A.M. Frieze
Journal of Graph Theory
34
(1), 2000, pp. 42-59
Local and mean Ramsey numbers for trees
B. Bollobás
,
A. Kostochka
,
R.H. Schelp
Journal of Combinatorial Theory Series B
79
(1), 2000, pp. 100-103
Exact bounds for judicious partitions of graphs
B. Bollobás
,
A.D. Scott
Combinatorica
19
(4), 1999, pp. 473-486
Judicious partitions of hypergraphs
B. Bollobás
,
A.D. Scott
Journal of Combinatorial Theory Series A
78
(1), 1997, pp. 15-31
On the best case of Heapsort
B. Bollobás
,
T.I. Fenner
,
A.M. Frieze
Journal of Algorithms
20
(2), 1996, pp. 205-217
A proof of a conjecture of Bondy concerning paths in weighted digraphs
B. Bollobás
,
A.D. Scott
Journal of Combinatorial Theory Series B
66
(2), 1996, pp. 283-292
An extension of the Erdös-Stone theorem
B. Bollobás
,
Y. Kohayakawa
Combinatorica
14
(2), 1994, pp. 279-286
List-colourings of graphs
B. Bollobás
,
A.J. Harris
Graphs and Combinatorics
1
, 1985, pp. 115-127
Regular factors of regular graphs
B. Bollobás
,
Akira Saito
,
N.C. Wormald
Journal of Graph Theory
9
(1), 1985, pp. 97-103
Graph-theoretic parameters concerning domination, independence, and irredundance
B. Bollobás
,
E.J. Cockayne
Journal of Graph Theory
3
(3), 1979, pp. 241-249
On complete subgraphs of
r
-chromatic graphs
B. Bollobás
,
P. Erdŏs
,
E. Szemerédi
Discrete Mathematics
13
, 1975, pp. 97-107