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=1981
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The longest path in a random graph
Miklós Ajtai
,
János Komlós
,
Endre Szemerédi
Combinatorica
1
, 1981, pp. 1-12
Minimal decompositions of graphs into mutually isomorphic subgraphs
F.R.K. Chung
,
P. Erdŏs
,
R.L. Graham
Combinatorica
1
, 1981, pp. 13-24
On the combinatorial problems which I would most like to see solved
P. Erdŏs
Combinatorica
1
, 1981, pp. 25-42
On matroid intersections
Heinz Gröflin
,
Alan J. Hoffman
Combinatorica
1
, 1981, pp. 43-47
Forests and score vectors
Daniel J. Kleitman
,
Kenneth J. Winston
Combinatorica
1
, 1981, pp. 49-54
Independence numbers of graphs and generators of ideals
Shuo-Yen Robert Li
,
Wen-Ch'ing Winnie Li
Combinatorica
1
, 1981, pp. 55-61
Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
J.H. van Lint
,
A. Schrijver
Combinatorica
1
, 1981, pp. 63-73
Recognizing graphic matroids
P.D. Seymour
Combinatorica
1
, 1981, pp. 75-78
Graph factors
W.T. Tutte
Combinatorica
1
, 1981, pp. 79-97
An upper bound for the cardinality of an
s
-distance subset in real Euclidean space
Eiichi Bannai
,
Etsuko Bannai
Combinatorica
1
, 1981, pp. 99-102
van der Waerden and Ramsey type games
József Beck
Combinatorica
1
, 1981, pp. 103-116
Cycles through specified vertices of a graph
J.A. Bondy
,
L. Lovász
Combinatorica
1
, 1981, pp. 117-140
On the conjecture of Hajós
Paul Erdŏs
,
Siemion Fajtlowicz
Combinatorica
1
, 1981, pp. 141-143
How to make a digraph strongly connected
András Frank
Combinatorica
1
, 1981, pp. 145-153
Maximum degree and fractional matchings in uniform hypergraphs
Zoltán Füredi
Combinatorica
1
, 1981, pp. 155-162
Equiarboreal graphs
C.D. Godsil
Combinatorica
1
, 1981, pp. 163-167
The ellipsoid method and its consequences in combinatorial optimization
M. Grötschel
,
L. Lovász
,
A. Schrijver
Combinatorica
1
, 1981, pp. 169-197
Simple proof of the existence of restricted Ramsey graphs by means of a partite construction
Jaroslav Nes̑etȓil
,
Vojtȇch Rödl
Combinatorica
1
, 1981, pp. 199-202
Suresums
Joel Spencer
Combinatorica
1
, 1981, pp. 203-208
Balancing families of integer sequences
József Beck
Combinatorica
1
, 1981, pp. 209-216
Combinatorial properties of polynominoes
C. Berge
,
C.C. Chen
,
V. Chvátal
,
C.S. Seow
Combinatorica
1
, 1981, pp. 217-224
Every large set of equidistant
(0,+1,-1)
-vectors forms a sunflower
M. Deza
,
P. Frankl
Combinatorica
1
, 1981, pp. 225-231
The eigenvalues of random symmetric matrices
Z. Füredi
,
J. Komlós
Combinatorica
1
, 1981, pp. 233-241
On the full automorphism group of a graph
C.D. Godsil
Combinatorica
1
, 1981, pp. 243-256
Hermite polynomials and a duality relation for matchings polynomials
C.D. Godsil
Combinatorica
1
, 1981, pp. 257-262
Seiten 1
2
>