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=6
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Adjoints of oriented matroids
A. Bachem
,
W. Kern
Combinatorica
6
(4), 1986, pp. 299-308
Extremal clique coverings of complementary graphs
D. de Caen
,
P. Erdŏs
,
N.J. Pullmann
,
N.C. Wormald
Combinatorica
6
(4), 1986, pp. 309-314
Counterexamples to conjectures on 4-connected matroids
C.R. Coullard
Combinatorica
6
(4), 1986, pp. 315-320
A completion problem for finite affine planes
S. Dow
Combinatorica
6
(4), 1986, pp. 321-326
Some intersection theorems on two-valued functions
R.J. Faudree
,
R.H. Schelp
,
V.T. Sós
Combinatorica
6
(4), 1986, pp. 327-334
Finite projective spaces and intersecting hypergraphs
P. Frankl
,
Z. Füredi
Combinatorica
6
(4), 1986, pp. 335-354
Families of finite sets with minimum shadows
Z. Füredi
,
J.R. Griggs
Combinatorica
6
(4), 1986, pp. 355-364
Matrices with the Edmonds-Johnson property
A.M.H. Gerards
,
A. Schrijver
Combinatorica
6
(4), 1986, pp. 365-380
Coloring planar perfect graphs by decomposition
W.-L. Hsu
Combinatorica
6
(4), 1986, pp. 381-386
A Las Vegas RNC algorithm for maximum matching
H.J. Karloff
Combinatorica
6
(4), 1986, pp. 387-392
Clique covering of graphs
L. Pyber
Combinatorica
6
(4), 1986, pp. 393-398
Seiten
<
1
2