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
[1]
Hilfe
Suche: Journal=Combinatorica AND YEAR=1984
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Measurable chromatic number of geometric graphs and sets without some distances in Euclidean space
L.A. Székely
Combinatorica
4
, 1984, pp. 213-218
Canonization theorems for finite affine and linear spaces
B. Voigt
Combinatorica
4
, 1984, pp. 219-239
Girths of bipartite sextet graphs
Alfred Weiss
Combinatorica
4
, 1984, pp. 241-245
The exact bound in the Erdŏs-Ko-Rado theorem
Richard M. Wilson
Combinatorica
4
, 1984, pp. 247-257
On optimal matchings
M. Ajtai
,
J. Komlós
,
G. Tusnády
Combinatorica
4
, 1984, pp. 259-264
Cycles through ten vertices in 3-connected cubic graphs
M.N. Ellingham
,
D.A. Holton
,
C.H.C. Little
Combinatorica
4
, 1984, pp. 265-273
Disjoint shortest paths in graphs
Hikoe Enomoto
,
Akira Saito
Combinatorica
4
, 1984, pp. 275-279
Path-closed sets
Heinz Gröflin
Combinatorica
4
, 1984, pp. 281-290
A topological approach to evasiveness
Jeff Kahn
,
Michael Saks
,
Dean Sturtevant
Combinatorica
4
, 1984, pp. 297-306
Lower bound of the Hadwiger number of graphs by their average degree
A.V. Kostochka
Combinatorica
4
, 1984, pp. 307-316
A class of dimension-skipping graphs
Igor Kr̆iz̆
Combinatorica
4
, 1984, pp. 317-319
On equidistant binary codes of length
n=4k + 1
with distance
d = 2k
J.H. van Lint
Combinatorica
4
, 1984, pp. 321-323
Automorphisms of random graphs with specified vertices
B.D. McKay
,
N.C. Wormald
Combinatorica
4
, 1984, pp. 325-338
The reconstruction problem for certain infinite graphs
M. von Rimscha
Combinatorica
4
, 1984, pp. 339-343
On combinatorial properties of spheres in Euclidean spaces
V. Rödl
Combinatorica
4
, 1984, pp. 345-349
On automorphisms of infinite graphs with forbidden subgraphs
N. Seifter
Combinatorica
4
, 1984, pp. 351-356
The equivalence of certain equidistant binary codes and symmetric BIBDs
D.R. Stinson
,
G.H.J. van Rees
Combinatorica
4
, 1984, pp. 357-362
On the number of homogeneous subgraphs of a graph
L.A. Székely
Combinatorica
4
, 1984, pp. 363-372
A new polynomial-time algorithm for linear programming
N. Karmarkar
Combinatorica
4
, 1984, pp. 373-395
Seiten
<
1
2