Discrete Mathematics, Volume 59

Volume 59, Numbers 1-2, April 1986

• Kenneth A. Berman:
  Parity results on connected f-factors. 1-8
  Electronic Edition (link) BibTeX
• Wayne M. Dymàcek:
  Bipartite Steinhaus graphs. 9-20
  Electronic Edition (link) BibTeX
• Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress:
  Coloring graphs with locally few colors. 21-34
  Electronic Edition (link) BibTeX
• Hortensia Galeana-Sánchez:
  A theorem about a conjecture of H. Meyniel on kernel-perfect graphs. 35-41
  Electronic Edition (link) BibTeX
• David G. Glynn:
  The non-classical 10-arc of PG(4, 9). 43-51
  Electronic Edition (link) BibTeX
• Michael Hager:
  Path-connectivity in graphs. 53-59
  Electronic Edition (link) BibTeX
• András Hajnal, N. Sauer:
  Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets. 61-67
  Electronic Edition (link) BibTeX
• Katherine Heinrich, L. Zhu:
  Existence of orthogonal latin squares with aligned subsquares. 69-78
  Electronic Edition (link) BibTeX
• Alain Hertz:
  Quelques utilisations de la struction. 79-89
  Electronic Edition (link) BibTeX
• Vikram Jha, Norman L. Johnson:
  Regular parallelisms from translation planes. 91-97
  Electronic Edition (link) BibTeX
• R. P. Nederpelt:
  Bijections between formulae and trees which are compatible with equivalences of the type ((f·g)·h)~((f·h)·g). 99-105
  Electronic Edition (link) BibTeX
• P. J. Owens:
  Simple 3-polytopal graphs with edges of only two types and shortness coefficients. 107-114
  Electronic Edition (link) BibTeX
• D. Piollet:
  Solutions d'une equation quadratique dans le groupe libre. 115-123
  Electronic Edition (link) BibTeX
• Vojtech Rödl:
  On universality of graphs with uniformly distributed edges. 125-134
  Electronic Edition (link) BibTeX
• Michael E. Saks:
  Some sequences associated with combinatorial structures. 135-166
  Electronic Edition (link) BibTeX
• Yongbing Shi:
  Some theorems of uniquely pancyclic graphs. 167-180
  Electronic Edition (link) BibTeX
• R. J. Simpson:
  Exact coverings of the integers by arithmetic progressions. 181-190
  Electronic Edition (link) BibTeX
• Mauro Cerasoli:
  Enumeration with the lattice of periods. 191-198
  Electronic Edition (link) BibTeX
• A. Patricia Shelton, Ronald D. Dutton, Robert C. Brigham:
  Extension of a clique cover result to uniform hypergraphs. 199-201
  Electronic Edition (link) BibTeX

Volume 59, Number 3, May 1986

• Albrecht Beutelspacher, Inge Schestag:
  Finite linear spaces in which any n-gon is euclidean. 207-220
  Electronic Edition (link) BibTeX
• Arie Bialostocki, N. Sauer:
  On Ramsey-Turán type problems in tournaments. 221-228
  Electronic Edition (link) BibTeX
• James R. Clay:
  More balanced incomplete block designs from frobenius groups. 229-234
  Electronic Edition (link) BibTeX
• Paul Erdös, Marcel Erné:
  Clique numbers of graphs. 235-242
  Electronic Edition (link) BibTeX
• Alan M. Frieze:
  On large matchings and cycles in sparse random graphs. 243-256
  Electronic Edition (link) BibTeX
• Hortensia Galeana-Sánchez, Victor Neumann-Lara:
  On kernel-perfect critical digraphs. 257-265
  Electronic Edition (link) BibTeX
• David A. Gregory, S. McGuinness, W. Wallis:
  Clique partitions of the cocktail party graph. 267-273
  Electronic Edition (link) BibTeX
• Alan Hartman:
  On small packing and covering designs with block size 4. 275-281
  Electronic Edition (link) BibTeX
• W. Cary Huffman:
  On automorphism groups of certain 2-(v, 3, 2) designs induced by group actions. 283-296
  Electronic Edition (link) BibTeX
• Bernhard Korte, László Lovász:
  Non-interval greedoids and the transposition property. 297-314
  Electronic Edition (link) BibTeX
• Andries E. Brouwer:
  An inequality in binary vector spaces. 315-317
  Electronic Edition (link) BibTeX
• Bernt Lindström:
  A non-linear algebraic matroid with infinite characteristic set. 319-320
  Electronic Edition (link) BibTeX