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 YEAR=1984
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
n
points in the plane can determine
n^{3/2}
unit circles
G. Elekes
Combinatorica
4
, 1984, pp. 131
On an obstruction for perfect matchings
Ron Aharoni
Combinatorica
4
, 1984, pp. 1-6
Diameters of random bipartite graphs
Béla Bollobás
,
Victor Klee
Combinatorica
4
, 1984, pp. 7-19
Intersecting Sperner families and their convex hulls
Paul Erdŏs
,
P. Frankl
,
G.O.H. Katona
Combinatorica
4
(1), 1984, pp. 21-34
Independence, clique size and maximum degree
Siemion Fajtlowicz
Combinatorica
4
, 1984, pp. 35-38
On disjointly representable sets
Peter Frankl
,
János Pach
Combinatorica
4
, 1984, pp. 39-45
Explicit construction of regular graphs without small cycles
Wilfried Imrich
Combinatorica
4
, 1984, pp. 53-59
On random mapping patterns
A. Meir
,
J.W. Moon
Combinatorica
4
, 1984, pp. 61-70
Sparse Ramsey graphs
Jaroslav Nes̑etȓil
,
Vojtȇch Rödl
Combinatorica
4
, 1984, pp. 71-78
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems
Kevin T. Phelps
,
Vojtȇch Rödl
Combinatorica
4
, 1984, pp. 79-88
Perfect matchings in hexagonal systems
Horst Sachs
Combinatorica
4
, 1984, pp. 89-99
On restricted colourings of
K_n
Miklós Simonovits
,
Vera T. Sŏs
Combinatorica
4
, 1984, pp. 101-110
Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
Zsolt Tuza
Combinatorica
4
, 1984, pp. 111-116
Regressions and monotone chains: A Ramsey-type extremal problem for partial orders
D.B. West
,
W.T., Jr. Trotter
,
G.W. Peck
,
P. Shor
Combinatorica
4
, 1984, pp. 117-119
The directed packing numbers
DD(t, v, v)
,
t \geq 4
J.E. Dawson
,
Jennifer Seberry
,
D.B. Skillicorn
Combinatorica
4
, 1984, pp. 121-130
An Erdŏs-Ko-Rado theorem for the subcubes of a cube
Konrad Engel
Combinatorica
4
, 1984, pp. 133-140
Families of finite sets with three interesections
P. Frankl
Combinatorica
4
, 1984, pp. 141-148
Hypergraphs do not jump
P. Frankl
,
V. Rödl
Combinatorica
4
, 1984, pp. 149-159
Hypergraphs in which all disjoint pairs have distinct unions
Z. Füredi
Combinatorica
4
, 1984, pp. 161-168
Isomorphic factorizations VIII: Bisectable trees
Frank Harary
,
Robert W. Robinson
Combinatorica
4
, 1984, pp. 169-179
A polyomino with no stochastic function
Jeffry Kahn
,
Michael Saks
Combinatorica
4
, 1984, pp. 181-182
On coloring graphs with locally small chromatic number
H.A. Kierstead
,
E. Szemerédi
,
W.T., Jr. Trotter
Combinatorica
4
, 1984, pp. 183-185
On the intersections of circuits and cocircuits in matroids
James G. Oxley
Combinatorica
4
, 1984, pp. 187-195
Geodetic blocks of diameter three
K.R. Parthasarathy
,
N. Srinivasan
Combinatorica
4
, 1984, pp. 197-206
H
-extension of graphs
S.C. Shee
,
H.H. Teh
Combinatorica
4
, 1984, pp. 207-211
Seiten 1
2
>