Volume 13,
Number 1,
1993
- Béla Bollobás, Paul Erdös, Joel Spencer, Douglas B. West:
Clique coverings of the edges of a random graph.
1-5
- Collette R. Coullard, L. Leslie Gardner, Donald K. Wagner:
Decomposition of 3-connected graphs.
7-30
- Paul Erdös, András Hajnal, Miklós Simonovits, Vera T. Sós, Endre Szemerédi:
Turán-Ramsey theorems and simple asymptotically extremal structures.
31-56
- Paul Erdös, L. Bruce Richmond:
On graphical partitions.
57-63
- András Frank:
Conservative weightings and ear-decompositions of graphs.
65-81
- George S. Lueker, Mariko Molodowitch:
More analysis of double hashing.
83-96
- Matthias Middendorf, Frank Pfeiffer:
On the complexity of the disjoint paths problems.
97-107
- Alexander Sidorenko:
Boundedness of optimal matrices in extremal multigraph and digraph problems.
109-120
Notes
- Oleg V. Borodin:
Joint extension of two theorems of Kotzig on 3-polytopes.
121-125
- Zhen Zhang:
A note on arrays of dots wit distinct slopes.
127-128
Volume 13,
Number 2,
1993
Notes
Volume 13,
Number 3,
1993
Volume 13,
Number 4,
1993
- Peter J. Cameron, Cheryl E. Praeger, Nicholas C. Wormald:
Infinite highly arc transitive digraphs and universal covering digraphs.
377-396
- Michel Deza, Viatcheslav P. Grishukhin, Monique Laurent:
The hypermetric cone is polydedral.
397-411
- Peter Frankl, Norihide Tokushige:
Weight functions on the kneser graph and the solution of an intersection problem of Sali.
413-420
- Pavol Hell, Huishan Zhou, Xuding Zhu:
Homomorphisms to oriented cycles.
421-433
- Kyriakos Kilakos, B. Reed:
Fractionally colouring total graphs.
435-440
- Nathan Linial, Michael E. Saks:
Low diameter graph decompositions.
441-454
- Jirí Matousek, Emo Welzl, Lorenz Wernisch:
Discrepancy and approximations for bounded VC-dimension.
455-466
- James G. Oxley, Geoff Whittle:
Some exluded-minor theorems for a class of polymatroids.
467-476
- Karen Seyffarth:
Small cycle double covers of 4-connected planer.
477-482
- Micha Sharir:
k-sets and random hulls.
483-496
Copyright © Tue Nov 17 01:25:39 2009
by Michael Ley (ley@uni-trier.de)