Volume 4,
Number 1,
1984
- Ron Aharoni:
On an obstruction for perfect matching.
1-7
- Béla Bollobás, Victor Klee:
Diameters of random bipartite graphs.
7-19
- Péter L. Erdös, Peter Frankl, Gyula O. H. Katona:
Intersecting Sperner families and their convex hulls.
21-34
- Siemion Fajtlowicz:
Independence, clique size and maximum degree.
35-38
- Peter Frankl, János Pach:
On disjointly representable sets.
39-45
- András Hajnal, Péter Komjáth:
What must and what need not be contained in a graph of uncountable chromatic number?.
47-52
- Wilfried Imrich:
Explicit construction of regular graphs without small cycles.
53-59
- Amram Meir, John W. Moon:
On random mapping patterns.
61-70
- Jaroslav Nesetril, Vojtech Rödl:
Sparse Ramsey graphs.
71-78
- Kevin T. Phelps, Vojtech Rödl:
On the algorithmic complexity of coloring simple hypergraphs and Steiner triple systems.
79-88
- Horst Sachs:
Perfect matchings in hexagonal systems.
89-99
- Miklós Simonovits, Vera T. Sós:
On restricted colourings of Kn.
101-110
- Zsolt Tuza:
Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices.
111-116
- Douglas B. West, William T. Trotter, G. W. Peck, Peter W. Shor:
Regressions and monotone chains: a ramsey - type extermal problem for partial orders.
117-119
Volume 4,
Number 2 - 3,
1984
- Jeremy E. Dawson, Jennifer Seberry, David B. Skillicorn:
The directed packing numbers DD (t, v, v), t>=;4.
121-130
- György Elekes:
n points in the plane can determine n 3/2 unit circles.
131-131
- Konrad Engel:
An Erdös - Ko- Rado theorem for the subcubes of a cube.
133-140
- Peter Frankl, Vojtech Rödl:
Families of finite sets with three intersections.
141-148
- Peter Frankl:
Hypergraphs do not jump.
149-159
- Zoltán Füredi:
Hypergraphs in which all disjoint pairs have distinct unions.
161-168
- Frank Harary, Robert W. Robinson:
Isomorphic factorizations VIII: Bisectable trees.
169-179
- Jeff Kahn, Michael E. Saks:
A polyomino with no stochastic function.
181-182
- Henry A. Kierstead, Endre Szemerédi, William T. Trotter:
On coloring graphs with locally small chromatic number.
183-185
- James G. Oxley:
On the intersections of circuits and cocircuits in matroids.
187-195
- K. R. Parthasarathy, N. Srinivasan:
Geodetic blocks of diameter three.
197-206
- S. C. Shee, H. H. Teh:
H-extensions of graphs.
207-212
- László A. Székely:
Measurable chromatic number of geometric graphs and sets without some distnaces in euclidean space.
213-218
- Bernd Voigt:
Canonization theorems for finite affine and linear spaces.
219-239
- Alfred Weiss:
Girth of bipartite sextet graphs.
241-245
- Richard M. Wilson:
The exact bound in the Erdös - Ko - Rado theorem.
247-257
Volume 4,
Number 4,
1984
- Miklós Ajtai, János Komlós, Gábor E. Tusnády:
On optimal matchings.
259-264
- Mark N. Ellingham, Derek A. Holton, Charles H. C. Little:
Cycles through ten vertices in 3-connected cubic graphs.
265-273
- Hikoe Enomoto, Akira Saito:
Disjoint shortest paths in graphs.
275-279
- Heinz Gröflin:
Path-closed sets.
281-290
- Martin Grötschel, László Lovász, Alexander Schrijver:
Corrigendum to our paper "The ellipsoid method and its consequences in combinatorial optimization".
291-295
- Jeff Kahn, Michael E. Saks, Dean Sturtevant:
A topological approach to evasiveness.
297-306
- Alexandr V. Kostochka:
Lower bound of the Hadwiger number of graphs by their average degree.
307-316
- Igor Kríz:
A class of dimension-skipping graphs.
317-319
- Jacobus H. van Lint:
On equidistant binary codes length n = 4k+1 with distance d = 2k.
321-323
- Brendan D. McKay, Nicholas C. Wormald:
Automorphisms of random graphs with specified vertices.
325-338
- Michael von Rimscha:
The reconstruction problem for certain infinite graphs.
339-344
- Vojtech Rödl:
On combinatorial properties of spheres in eulidean spaces.
345-349
- Norbert Seifter:
On automorphisms of infinite graphs with forbidden subgraphs.
351-356
- Douglas R. Stinson, G. H. John van Rees:
The equivalence of certain equidistant binary codes and symmetric BIBDs.
357-362
- László A. Székely:
On the number of homogeneous subgraphs of a graph.
363-372
- Narendra Karmarkar:
A new polynomial-time algorithm for linear programming.
373-396
Copyright © Sun Dec 20 01:15:58 2009
by Michael Ley (ley@uni-trier.de)
