271 | -- | 282 | R. W. Decker, H. H. Glover, L. P. Huneke. Computing the genus of the 2-amalgamations of graphs |
283 | -- | 293 | Reinhard Diestel, Rudolf Halin, Walter Vogler. Some remarks on universal graphs |
295 | -- | 300 | Mohamed M. El-Zahar, Paul Erdös. On the existence of two non-neighboring subgraphs in a graph |
301 | -- | 309 | 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 |
311 | -- | 318 | Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp. Multipartite graph - space graph Ramsey numbers |
319 | -- | 323 | Jeff Kahn. A problem of P. Seymour on nonbinary matroids |
325 | -- | 336 | Alexander V. Karzanov. Families of cuts with the MFMC-property |
337 | -- | 342 | H. J. Landau, B. F. Logan, Larry A. Shepp. An inequality conjectured by Hajela and Seymour arising in combinatorial geometry |
343 | -- | 345 | James G. Oxley. Proof of a conjecture of Kahn for non-binary matroids |
347 | -- | 349 | László Pyber. Regular subgraphs of dense graphs |
351 | -- | 358 | S. S. Shrikhande, N. M. Singhi. On a problem of Erdös and Larson |
359 | -- | 365 | K. Steffens. Maximal tight sets and the Edmonds - Gallai decomposition for matchings |
367 | -- | 378 | Robert Endre Tarjan. Sequential access in play trees takes linear time |