Computing the genus of the 2-amalgamations of graphs R. W. DeckerH. H. GloverJ. P. Huneke OriginalPaper Pages: 271 - 282
Some remarks on universal graphs Reinhard DiestelRudolf HalinWalter Vogler OriginalPaper Pages: 283 - 293
On the existence of two non-neighboring subgraphs in a graph M. El-ZaharP. Erdős OriginalPaper Pages: 295 - 300
About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets Konrad EngelNikolaj Nikolajevič Kuzjurin OriginalPaper Pages: 301 - 309
Multipartite graph—Sparse graph Ramsey numbers P. ErdősR. J. FaudreeR. H. Schelp OriginalPaper Pages: 311 - 318
An inequality conjectured by Hajela and Seymour arising in combinatorial geometry H. J. LandauB. F. LoganL. A. Shepp OriginalPaper Pages: 337 - 342
Maximal tight sets and the edmonds—Gallai decomposition for matchings K. Steffens OriginalPaper Pages: 359 - 365
