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: Journal=Combinatorica AND Volume=11
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some nonexistence results on divisible difference sets
K.T. Arasu
,
James Davis
,
Dieter Jungnickel
,
Alexander Pott
Combinatorica
11
, 1991, pp. 1-8
The existence of non-trivial hyperfactorizations of
K_{2n}
Endre Boros
,
Dieter Jungnickel
,
Scott A. Vanstone
Combinatorica
11
, 1991, pp. 9-16
On
\bmod p
transversals
Jeff Kahn
,
Roy Meshulam
Combinatorica
11
, 1991, pp. 17-22
An
\Omega(n^{5/4})
lower bound on the randomized complexity of graph properties
Valerie King
Combinatorica
11
, 1991, pp. 23-32
Efficient representation of perm groups
Donald E. Knuth
Combinatorica
11
, 1991, pp. 33-44
The chromatic number of random graphs
Tomasz Luczak
Combinatorica
11
, 1991, pp. 45-54
Spanning trees with bounded degrees
Victor Neumann-Lara
,
Eduardo Rivera-Campo
Combinatorica
11
, 1991, pp. 55-62
Pseudorandom bits for constant depth circuits
Noam Nisan
Combinatorica
11
, 1991, pp. 63-70
A mixed version of Menger's theorem
Yoshimi Egawa
,
Atsushi Kaneko
,
Makoto Matsumoto
Combinatorica
11
, 1991, pp. 71-74
Note on a Turán type problem of Erdös
Zoltán Füredi
Combinatorica
11
, 1991, pp. 75-79
Uniform cyclic edge connectivity in cubic graphs
R.E.L. Aldred
,
D.A. Holton
,
Bill Jackson
Combinatorica
11
, 1991, pp. 81-96
Parallel comparison algorithms for approximation problems
N. Alon
,
Y. Azar
Combinatorica
11
, 1991, pp. 97-122
Trees in tournaments
Roland Häggkvist
,
Andrew Thomason
Combinatorica
11
, 1991, pp. 123-130
An
\Omega(n^\frac{4}{3})
lower bound on the randomized complexity of graph properties
Péter Hajnal
Combinatorica
11
, 1991, pp. 131-143
Clean triangulations
Nora Hartsfield
,
Gerhard Ringel
Combinatorica
11
, 1991, pp. 145-155
On the power of white pebbles
Bala Kalyanasundaram
,
Georg Schnitger
Combinatorica
11
, 1991, pp. 157-171
On claws belonging to every tournament
Xiaoyun Lu
Combinatorica
11
, 1991, pp. 173-179
Effective on-line coloring of
P_5
-free graphs
András Gyárfás
,
Jenö Lehel
Combinatorica
11
, 1991, pp. 181-184
The edge density of 4-critical planar graphs
H.L. Abbott
,
B. Zhou
Combinatorica
11
, 1991, pp. 185-189
Cycles in weighted graphs
J.A. Bondy
,
Genghua Fan
Combinatorica
11
, 1991, pp. 191-205
The number of
t
-wise balanced designs
Charles J. Colbourn
,
Dean G. Hoffman
,
Kevin T. Phelps
,
Vojtȇch Rödl
,
Peter M. Winkler
Combinatorica
11
, 1991, pp. 207-218
b
-matching degree-sequence polyhedra
William H. Cunningham
,
Jan Green-Krótki
Combinatorica
11
, 1991, pp. 219-230
On the number of edge disjoint cliques in graphs of given size
Ervin Györi
Combinatorica
11
, 1991, pp. 231-243
A note on induced cycles in Kneser graphs
Y. Kohayakawa
Combinatorica
11
, 1991, pp. 245-251
Graham-Rothschild parameter words an measurable partitions
Hans Jürgen Prömel
,
Bernd Voigt
Combinatorica
11
, 1991, pp. 253-259
Seiten 1
2
>