Volume 81,
Number 1,
April 1990
Volume 81,
Number 2,
April 1990
- Yasukazu Aoki:
The star-arboricity of the complete regular multipartite graphs.
115-122
Electronic Edition (link) BibTeX
- Katarína Cechlárová, Peter Szabó:
On the monge property of matrices.
123-128
Electronic Edition (link) BibTeX
- Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter:
The maximum number of edges in 2K2-free graphs of bounded degree.
129-135
Electronic Edition (link) BibTeX
- L. H. Clark, Roger C. Entringer:
The number of cutvertices in graphs with given minimum degree.
137-145
Electronic Edition (link) BibTeX
- R. J. Clarke:
Covering a set by subsets.
147-152
Electronic Edition (link) BibTeX
- Herbert Edelsbrunner, Arch D. Robison, Xiaojun Shen:
Covering convex sets with non-overlapping polygons.
153-164
Electronic Edition (link) BibTeX
- Konrad Engel, Péter L. Erdös:
Polytopes determined by complementfree Sperner families.
165-169
Electronic Edition (link) BibTeX
- Alan M. Frieze:
On the independence number of random graphs.
171-175
Electronic Edition (link) BibTeX
- Igor Kríz, Robin Thomas:
Clique-sums, tree-decompositions and compactness.
177-185
Electronic Edition (link) BibTeX
- Martin Quest, Gerd Wegner:
Characterization of the graphs with boxicity <=2.
187-192
Electronic Edition (link) BibTeX
- Patrick Solé:
Completely regular codes and completely transitive codes.
193-201
Electronic Edition (link) BibTeX
- Cyriel Van Nuffelen, M. van Wouwe:
A bound for the Dilworth number.
203-210
Electronic Edition (link) BibTeX
- Sumanta Guha, Sriram Padmanabhan:
A new derivation of the generating function for the major index.
211-215
Electronic Edition (link) BibTeX
- Gilles Lachaud:
The parameters of projective Reed-Müller codes.
217-221
Electronic Edition (link) BibTeX
- Earl S. Kramer:
An S3(3, 5, 21) using graphs.
223-224
Electronic Edition (link) BibTeX
Volume 81,
Number 3,
May 1990
Copyright © Sat May 16 23:56:51 2009
by Michael Ley (ley@uni-trier.de)