Discrete Mathematics, Volume 81

Volume 81, Number 1, April 1990

• Moon-Jung Chung, Bala Ravikumar:
  Bounds on the size of test sets for sorting and related networks. 1-9
  
• David R. Guichard:
  Two theorems on the addition of residue classes. 11-18
  
• Nora Hartsfield, Gerhard Ringel:
  Quadrangular embeddings of the complete even k-partite graph. 19-23
  
• A. Hertz:
  Bipolarizable graphs. 25-32
  
• T. Maruta:
  On Singleton arrays and Cauchy matrices. 33-36
  
• Udo Pachner:
  Shellings of simplicial balls and P.L. manifolds with boundary. 37-47
  
• Rolf S. Rees:
  The existence of restricted resolvable designs I: (1, 2)-factorizations of K_2n. 49-80
  
• Jean-Pierre Roudneff:
  Partitions of points into intersecting tetrahedra. 81-86
  
• Eric Schmutz:
  Partitions whose parts are pairwise relatively prime. 87-89
  
• Robert A. Sulanke:
  A determinant for q-counting n-dimensional lattice paths. 91-96
  
• Shankar M. Venkatesan:
  On cleaving a planar graph. 97-102
  
• J. M. van den Akker, Jacobus H. Koolen, Rob J. M. Vaessens:
  Perfect modes with distinct protective radii. 103-109
  

Volume 81, Number 2, April 1990

• Yasukazu Aoki:
  The star-arboricity of the complete regular multipartite graphs. 115-122
  
• Katarína Cechlárová, Peter Szabó:
  On the monge property of matrices. 123-128
  
• Fan R. K. Chung, András Gyárfás, Zsolt Tuza, William T. Trotter:
  The maximum number of edges in 2K₂-free graphs of bounded degree. 129-135
  
• L. H. Clark, Roger C. Entringer:
  The number of cutvertices in graphs with given minimum degree. 137-145
  
• R. J. Clarke:
  Covering a set by subsets. 147-152
  
• Herbert Edelsbrunner, Arch D. Robison, Xiaojun Shen:
  Covering convex sets with non-overlapping polygons. 153-164
  
• Konrad Engel, Péter L. Erdös:
  Polytopes determined by complementfree Sperner families. 165-169
  
• Alan M. Frieze:
  On the independence number of random graphs. 171-175
  
• Igor Kríz, Robin Thomas:
  Clique-sums, tree-decompositions and compactness. 177-185
  
• Martin Quest, Gerd Wegner:
  Characterization of the graphs with boxicity <=2. 187-192
  
• Patrick Solé:
  Completely regular codes and completely transitive codes. 193-201
  
• Cyriel Van Nuffelen, M. van Wouwe:
  A bound for the Dilworth number. 203-210
  
• Sumanta Guha, Sriram Padmanabhan:
  A new derivation of the generating function for the major index. 211-215
  
• Gilles Lachaud:
  The parameters of projective Reed-Müller codes. 217-221
  
• Earl S. Kramer:
  An S₃(3, 5, 21) using graphs. 223-224
  

Volume 81, Number 3, May 1990

• C. R. J. Clapham:
  Graphs self-complementary in K_n - e. 229-235
  
• Wilfried Imrich, Gert Sabidussi:
  Focality and graph isomorphism. 237-245
  
• R. Kemp:
  On the number of deepest nodes in ordered trees. 247-258
  
• Louis Worthy Kolitsch:
  A simple proof of some congruences for colored generalized frobenius partitions. 259-261
  
• Rolf S. Rees:
  The existence of restricted resolvable designs II: (1, 2)-factorizations of K_2n+1. 263-301
  
• Dorothea Wagner:
  Decomposition of k-ary relations. 303-322
  
• Tom Blyth, Jules Varlet:
  Principal congruences on some lattice- ordered algebras. 323-329
  

Last update Tue May 21 18:47:57 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page