Discrete Mathematics, Volume 33

Volume 33, Number 1, 1981

• Béla Bollobás:
  Degree sequences of random graphs. 1-19
  
• Alexandru Filipoiu:
  Representation theorems for theta-valued Lukasiewicz algebras. 21-27
  
• Hubert de Fraysseix:
  Local complementation and interlacement graphs. 29-35
  
• Dirk Hausman:
  Adjacent vertices on the b-matching polyhedron. 37-51
  
• Nathan Linial:
  On Petersen's graph theorem. 53-56
  
• Kevin T. Phelps, Alexander Rosa:
  Steiner triple systems with rotational automorphisms. 57-66
  
• D. G. Rogers:
  Rhyming schemes: Crossings and coverings. 67-77
  
• Alan P. Sprague:
  Pasch's axiom and projective spaces. 79-87
  
• Douglas R. Stinson:
  A general construction for group-divisible designs. 89-94
  
• John Frederick Fink, H. Joseph Straight:
  A note on path-perfect graphs. 95-98
  
• D. J. Hansen:
  An axiomatic characterization of multilattices. 99-101
  
• Pierre Duchet, Henry Meyniel:
  A note on kernel-critical graphs. 103-105
  
• Hansjoachim Walther:
  Note on two problems of J. Zaks concerning Hamiltonian 3-polytopes. 107-109
  

Volume 33, Number 2, 1981

• J. A. Bondy, Stephen C. Locke:
  Relative lengths of paths and cycles in 3-connected graphs. 111-122
  
• Richard A. Brualdi, Jeffrey A. Ross:
  Matrices with isomorphic diagonal hypergraphs. 123-138
  
• Julien Constantin, Bernard Courteau:
  Partitions lineaires arguesiennes d'un espace vectoriel. 139-147
  
• A. K. Dewdney, Frank Harary:
  Oriented two-dimensional circuits. 149-162
  
• Alexandru Filipoiu:
  Some remarks on the representation theorem of moisil. 163-170
  
• Attila Máté:
  A lower estimate for the achromatic number of irreducible graphs. 171-183
  
• Doron Rotem:
  Stack sortable permutations. 185-196
  
• Henk C. A. van Tilborg:
  The smallest length of binary 7-dimensional linear codes with prescribed minimum distance. 197-207
  
• M. W. Warner, A. Muir:
  Homology theories and tolerance automata. 209-221
  
• J. Michael Steele:
  Long unimodal subsequences: a problem of F.R.K. Chung. 223-225
  

Volume 33, Number 3, 1981

• Stefan A. Burr, Paul Erdös, Ralph J. Faudree, Cecil C. Rousseau, Richard H. Schelp:
  Ramsey-minimal graphs for star-forests. 227-237
  
• G. F. Clements, Hans-Dietrich O. F. Gronau:
  On maximal antichains containing no set and its complement. 239-247
  
• Ernest J. Cockayne, Odile Favaron, C. Payan, A. G. Thomason:
  Contributions to the theory of domination, independence and irredundance in graphs. 249-258
  
• E. J. Farrell:
  Defect-d matchings in graphs with cyclomatic numbers 0, 1 and 2. 259-266
  
• George P. Grekos:
  Nonexistence of maximal asymptotic union nonbases. 267-270
  
• François Lalonde:
  Le probleme d'etoiles pour graphes est np-complet. 271-280
  
• James F. Lynch:
  The visually distinct configurations of k sets. 281-287
  
• B. R. Myers:
  Regular separable graphs of minimum order with given diameter. 289-311
  
• Roberta S. Wenocur, Richard M. Dudley:
  Some special vapnik-chervonenkis classes. 313-318
  
• Yair Caro, J. Schönheim:
  Generalized 1-factorization of trees. 319-321
  
• Jeff Kahn, Daniel J. Kleitman:
  On cross-bandwidth. 323-325