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=1985
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Decomposition of binary matroids
J.E. Dawson
Combinatorica
5
, 1985, pp. 1-9
Extremal hypegraph problems and convex hulls
Péter L. Erdŏs
,
P. Frankl
,
G.O.H. Katona
Combinatorica
5
, 1985, pp. 11-26
Set systems with three intersections
Z. Füredi
Combinatorica
5
, 1985, pp. 27-31
Inverses of trees
C.D. Godsil
Combinatorica
5
, 1985, pp. 33-39
On the sum of the reciprocals of cycle lengths in sparse graphs
A. Gyárfás
,
H.J. Prömel
,
E. Szemerédi
,
B. Voigt
Combinatorica
5
, 1985, pp. 41-52
Covering simply connected regions by rectangles
E. Gyŏri
Combinatorica
5
, 1985, pp. 53-55
Linear verification for spanning trees
J. Komlós
Combinatorica
5
, 1985, pp. 57-65
An Erdŏs-Gallai conjecture
L. Pyber
Combinatorica
5
, 1985, pp. 67-79
On generalized Ramsey numbers for trees
Jürgen Bierbrauer
,
Albrecht Brandis
Combinatorica
5
, 1985, pp. 95-107
A new upper bound for the length of snakes
Knut Deimer
Combinatorica
5
, 1985, pp. 109-120
The chromatic number of the product of two 4-chromatic graphs is 4
M. El-Zahar
,
N.W. Sauer
Combinatorica
5
, 1985, pp. 121-126
A characterization of planar graphs by Trémaux orders
H. de Fraysseix
,
P. Rosenstiehl
Combinatorica
5
, 1985, pp. 127-135
The chromatic number of the product of two
\aleph_1
-chromatic graphs can be countable
A. Hajnal
Combinatorica
5
, 1985, pp. 137-139
The struction of a graph: Application to
CN
-free graphs
P.L. Hammer
,
N.V.R. Mahadev
,
D. de Werra
Combinatorica
5
, 1985, pp. 141-147
A generalization of Dirac's theorem
S.C. Locke
Combinatorica
5
, 1985, pp. 149-159
Degree and local connectivity in digraphs
W. Mader
Combinatorica
5
, 1985, pp. 161-165
On triangulations of the convex hull of
n
points
B.L. Rothschild
,
E.G. Straus
Combinatorica
5
, 1985, pp. 167-179
Fractional matchings and covers in infinite hypergraphs
Ron Aharoni
Combinatorica
5
, 1985, pp. 181-184
On submodular function minimization
William H. Cunningham
Combinatorica
5
, 1985, pp. 185-192
Counting points in hypercubes and convolution measure algebras
D. Hajela
,
P. Seymour
Combinatorica
5
, 1985, pp. 205-214
Inclusion-exclusion inequalities
Melvin Hausner
Combinatorica
5
, 1985, pp. 215-225
Note to a problem of T. Gallai and G.A. Dirac
G. Koester
Combinatorica
5
, 1985, pp. 227-228
Maximum set of edges no two covered by a clique
A.V. Kostochka
Combinatorica
5
, 1985, pp. 229-235
A desarguesian theorem for algebraic combinatorial geometries
B. Lindström
Combinatorica
5
, 1985, pp. 237-239
On a problem of Spencer
J.B. Shearer
Combinatorica
5
, 1985, pp. 241-245
Seiten 1
2
>