Discrete Mathematics, Volume 50

Volume 50, 1984

• Edward A. Bender, John S. Devitt, L. Bruce Richmond:
  Partitions of multisets II. 1-8
  
• Jean-Claude Bermond, Michel Las Vergnas:
  Regular factors in nearly regular graphs. 9-13
  
• A. Robert Calderbank, Fan R. K. Chung, D. G. Sturtevant:
  Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs. 15-28
  
• Charles J. Colbourn, Asia Ivic Weiss:
  A census of regular 3-polystroma arising from honeycombs. 29-36
  
• Dragos Cvetkovic, Milenko Petric:
  A table of connected graphs on six vertices. 37-49
  
• David Joyce:
  Generalized chromatic polynomials. 51-62
  
• Rolf H. Möhring:
  Almost all comparability graphs are UPO. 63-70
  
• W. E. Opencomb:
  On the intricacy of combinatorial construction problems. 71-97
  
• Patricia Vanden Cruyce:
  A convex characterization of the graphs of the dodecahedron and icosahedron. 99-105
  
• C. Berge, Michel Las Vergnas:
  Transversals of circuits and acyclic orientations in graphs and matroids. 107-108
  
• P. Arbouz:
  Permutations representatives d'un graphe a seuil. 109-112
  
• N. Tsikopoulos:
  Cycles through k+2 vertices in k-connected graphs. 113-114
  
• Hans-Jürgen Bandelt, Henry Martyn Mulder:
  Interval-regular graphs of diameter two. 117-134
  
• Edward A. Bender, L. Bruce Richmond:
  An asymptotic expansion for the coefficients of some power series II: Lagrange inversion. 135-141
  
• Richard A. Brualdi, Rachel Manber:
  Chromatic number of classes of matrices of zeros and ones. 143-152
  
• Janusz A. Brzozowski, Faith E. Fich:
  On generalized locally testable languages. 153-169
  
• Stefan A. Burr:
  Some undecidable problems involving the edge-coloring and vertex-coloring of graphs. 171-177
  
• Bernard Courteau, Jacques Wolfmann:
  On triple-sum-sets and two or three weights codes. 179-191
  
• Judith E. Dayhoff:
  Independently prescriable sets of n-letter words. 193-219
  
• David E. Daykin, Jacqueline W. Daykin, Michael S. Paterson:
  On log concavity for order-preserving maps of partial orders. 221-226
  
• Mohamed H. El-Zahar:
  On circuits in graphs. 227-230
  
• Stanislav Jendrol:
  On a problem of J. Zaks concerning 5-valent 3-connected planar graphs. 231-237
  
• P. Marchioro, Aurora Morgana:
  Structure and recognition of domishold graphs. 239-251
  
• Ifor Morris, Christopher D. Wensley:
  Adams operations and lambda-operations in beta-rings. 253-270
  
• Heinrich Niederhausen:
  Sequences of binomial type with polynomial coefficients. 271-284
  
• David Peleg:
  A generalized closure and complement phenomenon. 285-293
  
• Chi Song Wong, Joseph C. Masaro:
  A-optimal design matrices. 295-318
  
• B. R. Handa, S. G. Mohanty:
  On the distribution in a graph process. 319-322
  
• Peter Frankl, Zoltán Füredi:
  An exact result for 3-graphs. 323-328