Volume 5, Number 1, 1985
Volume 5, Number 2, 1985
Volume 5, Number 3, 1985
Volume 5, Number 4, 1985
- R. W. Decker, H. H. Glover, L. P. Huneke:
Computing the genus of the 2-amalgamations of graphs.
271-282

- Reinhard Diestel, Rudolf Halin, Walter Vogler:
Some remarks on universal graphs.
283-293

- Mohamed M. El-Zahar, Paul Erdös:
On the existence of two non-neighboring subgraphs in a graph.
295-300

- Konrad Engel, Nikolai N. Kuzjurin:
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets.
301-309

- Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
Multipartite graph - space graph Ramsey numbers.
311-318

- Jeff Kahn:
A problem of P. Seymour on nonbinary matroids.
319-323

- Alexander V. Karzanov:
Families of cuts with the MFMC-property.
325-336

- H. J. Landau, B. F. Logan, Larry A. Shepp:
An inequality conjectured by Hajela and Seymour arising in combinatorial geometry.
337-342

- James G. Oxley:
Proof of a conjecture of Kahn for non-binary matroids.
343-345

- László Pyber:
Regular subgraphs of dense graphs.
347-349

- S. S. Shrikhande, N. M. Singhi:
On a problem of Erdös and Larson.
351-358

- K. Steffens:
Maximal tight sets and the Edmonds - Gallai decomposition for matchings.
359-365

- Robert Endre Tarjan:
Sequential access in play trees takes linear time.
367-378

Last update Wed May 22 17:12:09 2013
CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page