Discrete Mathematics, Volume 31

Volume 31, Number 1, 1980

• Kenneth P. Bogart:
  Incidence codes of posets: Eulerian posets and Reed-Muller codes. 1-7
  
• Nachum Dershowitz, Shmuel Zaks:
  Enumerations of ordered trees. 9-28
  
• J. T. Joichi, Dennis E. White:
  Gray codes in graphs of subsets. 29-41
  
• T. D. Parsons, Tomaz Pisanski, Brad Jackson:
  Dual imbeddings and wrapped quasi-coverings of graphs. 43-52
  
• George B. Purdy, John E. Wetzel:
  Two-coloring inequalities for Euclidean arrangements in general position. 53-58
  
• David W. Walkup:
  Matchings in random regular bipartite digraphs. 59-64
  
• Doron Zeilberger:
  Partial difference equations in m₁>=m₂>= ... >=m_n>=0 and their applications to combinatorics. 65-77
  
• Tor Bu:
  Partitions of a vector space. 79-83
  
• M. L. Gardner:
  Forbidden configurations in intersection graphs of r-graphs. 85-88
  
• Yahya Ould Hamidoune:
  On the decomposition of a minimally strongly h-connected digraph into h+1 acircuitic sub-graphs. 89-90
  
• S. P. Mohanty:
  Shortest string containing all permutations. 91-95
  
• Man-Keung Siu, Po Tong:
  Generation of some de Bruijn sequences. 97-100
  
• Anders Björner:
  Some matroid inequalities. 101-103
  
• Yahya Ould Hamidoune:
  A property of a-fragments of a digraph. 105-106
  
• Denis Naddef, Najiba Sbihi, Maurice Tchuente:
  Independence systems with continuous cardinality of bases. 107-109
  
• L. Zhu:
  A pair of orthogonal Steiner systems S(3, 5, 17). 111-113
  

Volume 31, Number 2, 1980

• Amos Altshuler, Jürgen Bokowski, Leon Steinberg:
  The classification of simplicial 3-spheres with nine vertices into polytopes and nonpolytopes. 115-124
  
• Lars Døvling Andersen, Anthony J. W. Hilton:
  Generalized Latin rectangles I: Construction and decomposition. 125-152
  
• Lowell W. Beineke, Richard D. Ringeisen, Joseph Straight:
  The cochromatic index of a graph. 153-159
  
• Tom Brylawski, James Oxley:
  Several identities for the characteristic polynomial of a combinatorial geometry. 161-170
  
• Paul H. Edelman:
  Chain enumeration and non-crossing partitions. 171-180
  
• J. D. Henstridge, Cheryl E. Praeger:
  Note on primitive permutation groups and a diophantine equation. 181-183
  
• R. H. Johnson:
  Properties of unique realizations - a survey. 185-192
  
• Kevin T. Phelps:
  Automorphism free latin square graphs. 193-200
  
• Michael D. Plummer:
  On n-extendable graphs. 201-210
  
• Hans S. Witsenhausen:
  On intersections of interval graphs. 211-216
  
• Marie-Claude Heydemann:
  On cycles and paths in digraphs. 217-219
  
• Manfred Schulz:
  An example of a cubic graph with two orbits and simple eigenvalue sqrt(3). 221-222
  

Volume 31, Number 3, 1980

• Michael O. Albertson, David M. Berman:
  Critical graphs for chromatic difference sequences. 225-233
  
• Lars Døvling Andersen, Anthony J. W. Hilton:
  Generalized latin rectangles II: Embedding. 235-260
  
• Marilena Barnabei, Andrea Brini:
  Some properties of characteristic polynomials and applications to T-lattices. 261-270
  
• G. Cohen, P. Frankl:
  On tilings of the binary vector space. 271-277
  
• K. M. Koh, D. G. Rogers, T. Tan:
  Products of graceful trees. 279-292
  
• Günther Malle:
  Edge orientations on cubic graphs with a maximum number of pairs of oppositely oriented edges. 293-296
  
• Stephen B. Maurer, I. Rabinovitch, William T. Trotter:
  Large minimal realizers of a partial order II. 297-313
  
• Carsten Thomassen:
  On the number of Hamiltonian cycles in tournaments. 315-323
  
• Rudolf Halin:
  A note on infinite triangulated graphs. 325-326
  
• Michel Las Vergnas:
  Fundamental circuits and a characterization of binary matroids. 327
  
• J.-C. Fournier:
  Demonstration simple du theoreme de Kuratowski et de sa forme duale. 329-332
  
• Douglas R. Stinson:
  A skew room square of order 129. 333-335
  
• Jacques Wolfmann:
  A new construction of the binary golay code (24, 12, 8) using a group algebra over a finite field. 337-338