Volume 9,
Number 1,
1989
Note
- Ervin Györi:
On the number of C5's in a triangle-free graph.
101-102
- Igor Kríz:
A cycle-space invariant of the <2-distance-graph in the plane.
103-105
- Bernt Lindström:
Matroids algebraic over F(t) are algebraic over F.
107-110
Volume 9,
Number 2,
1989
Notes
- Igor Kríz:
A hypergraph-free construction of highly chromatic graph without short cycles.
227-229
- Jan Reiterman:
A note on monotone paths in labeled graphs.
231-232
Volume 9,
Number 3,
1989
- H. L. Abbott, D. R. Hare:
Sparse color-critical hypergraphs.
233-243
- Paul Erdös, András Gyárfás, Edward T. Ordman, Yechezkel Zalcstein:
The size of chordal, interval and threshold subgraphs.
245-253
- A. V. Ivanov:
Non rank 3 strongly regular graphs with the 5-vertex condition.
255-260
- Heinz Adolf Jung, Mark E. Watkins:
The connectivities of locally finite primitive graphs.
261-267
- David Lichtenstein, Nathan Linial, Michael E. Saks:
Some extremal problems arising form discrete control processes.
269-287
- David Peleg, Eli Upfal:
Constructng disjoint paths on expander graphs.
289-313
- Lajos Rónyai, Tamás Szonyi:
Planar functions over finite fields.
315-320
Volume 9,
Number 4,
1989
Copyright © Fri Nov 27 19:50:15 2009
by Michael Ley (ley@uni-trier.de)
