Discrete Mathematics, Volume 47

Volume 47, 1983

• D. Borkovitz, F. K. Hwang:
  Multiplicative magic squares. 1-11
  
• Cai Mao-cheng:
  Solutions to Edmonds' and Katona's problems on families of separating subsets. 13-21
  
• Amanda G. Chetwynd, H. P. Yap:
  Chromatic index critical graphs of order 9. 23-33
  
• Manfred Droste:
  Products of conjugacy classes of the infinite symmetric groups. 35-48
  
• Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson:
  Finite linear spaces and projective planes. 49-62
  
• Peter C. Fishburn:
  Interval lengths for interval orders: A minimization problem. 63-82
  
• Wen-Ching Winnie Li:
  Determination of the residue classes of a polynomial at integral arguments. 83-90
  
• Michael Plantholt:
  The chromatic index of graphs with large maximum degree. 91-96
  
• Bernd Voigt:
  Combinatorial properties of regressive mappings. 97-108
  
• N. Hegde, R. C. Read, M. R. Sridharan:
  The enumeration of transitive self-complementary digraphs. 109-112
  
• Mikio Kano, Akira Saito:
  [a, b]-factors of graphs. 113-116
  
• George Mills:
  A quintessential proof of van der Waerden's theorem on arithmetic progressions. 117-120
  
• Cees Roos:
  A note on the existence of perfect constant weight codes. 121-123
  
• Douglas R. Stinson, W. D. Wallis:
  Two-fold triple systems without repeated blocks. 125-128
  
• Zoltán Füredi:
  On finite set-systems whose every intersection is a Kernel of a star. 129-132
  
• Rudolf Ahlswede, Klaus-Uwe Koschnick:
  Note on an extremal problem arising for unreliable networks in parallel computing. 137-152
  
• Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel:
  Domination alteration sets in graphs. 153-161
  
• Carlo Bernasconi:
  Smooth designs. 163-168
  
• Vasanti N. Bhat-Nayak, Ranjan N. Naik:
  Solutions of some further graph equations. 169-175
  
• Andries E. Brouwer, Pierre Duchet, Alexander Schrijver:
  Graphs whose neighborhoods have no special cycles. 177-182
  
• Charalambos A. Charalambides, M. Koutras:
  On the differences of the generalized factorials at an arbitrary point and their combinatorial applications. 183-201
  
• Anne Delandtsheer:
  The rigidity of the smallest unknown pi-space. 203-210
  
• Duane Detemple, Jack M. Robertson:
  Permutations associated with billiard paths. 211-219
  
• Jeffrey H. Dinitz, Douglas R. Stinson, W. D. Wallis:
  Room squares with holes of sides 3, 5, and 7. 221-228
  
• Konrad Engel:
  Strong properties in partially ordered sets I. 229-234
  
• Michael Hager:
  On Halin-lattices in graphs. 235-246
  
• Charles A. Jones:
  Using linear forms to determine the set of integers realizable by (g₀, g₁, ..., g_n)-trees. 247-254
  
• Philip J. Laufer, Jean M. Turgeon:
  On a conjecture of Paul Erdös for perfect systems of difference sets. 255-266
  
• Claudio L. Lucchesi, Jeffrey A. Ross:
  Superfluous paths in strong digraphs. 267-273
  
• A. Panayotopoulos:
  Some considerations on permutation trees. 275-281
  
• Michael von Rimscha:
  Reconstructibility and perfect graphs. 283-291
  
• Christian Ronse:
  A generalization of the perfect shuffle. 293-306
  
• Ronny Rousseau:
  Representations of a sublattice of the partition lattice on a lattice. 307-314
  
• Patrice Assouad:
  Binary contraction of graphs. 315-319
  
• Roland Häggkvist, P.-O. Lindberg, B. Lindström:
  Dissecting a square into rectangles of equal area. 321-323