Discrete Mathematics, Volume 57

Volume 57, Numbers 1-2, November 1985

• Alan R. Camina:
  Automorphism groups of block designs which are block transitive. 1-7
  
• Walter Alexandre Carnielli:
  On covering and coloring problems for rook domains. 9-16
  
• Alberto Cavicchioli:
  Lins-Mandel crystallizations. 17-37
  
• I. P. Goulden:
  A bijective proof of the q-Saalschütz theorem. 39-44
  
• F. T. Howard:
  Degenerate weighted Stirling numbers. 45-58
  
• Jenö Lehel:
  A characterization of totally balanced hypergraphs. 59-65
  
• Russell W. Myers:
  1-homogeneous graphs. 67-88
  
• Andrew M. Odlyzko, Janos Pintz, Kenneth B. Stolarsky:
  Partitions of planar sets into small triangles. 89-97
  
• Erwin Pesch, Werner Poguntke:
  A characterization of absolute retracts of n-chromatic graphs. 99-104
  
• Christoph Peter-Orth:
  All solutions of the Soma cube puzzle. 105-121
  
• Sergio Ruiz:
  Randomly decomposable graphs. 123-128
  
• Katalin Vesztergombi:
  On the distribution of distances in finite sets in the plane. 129-145
  
• Donald K. Wagner:
  On theorems of Whitney and Tutte. 147-154
  
• Alexander R. Bednarek, Robert E. Osteen:
  A characterization of graphical covers. 155-158
  
• Neal Brand:
  Isomorphic designs that are not multiplier equivalent. 159-165
  
• Pierre Leroux, Volker Strehl:
  Jacobi polynomials: Combinatorics of the basic identities. 167-187
  
• Bruce Reznick, Prasoon Tiwari, Douglas B. West:
  Decomposition of product graphs into complete bipartite subgraphs. 189-193
  
• C. R. J. Clapham:
  The bipartite tournament associated with a fabric. 195-197
  
• Bill Jackson, Oscar Ordaz:
  A Chvátal-Erdös condition for (1, 1)-factors in digraphs. 199-201
  
• Václav Koubek, J. Rajlich:
  Combinatorics of the separaion by binary matrices. 203-208
  

Volume 57, Number 3, December 1985

• Th. Chadjipantelis, Stratis Kounias:
  Supplementary difference sets and D-optimal designs for n == 2 mod 4. 211-216
  
• Martin G. Everett, Stephen B. Seidman:
  The hull number of a graph. 217-223
  
• A. W. Goodman:
  Triangles in a complete chromatic graph with three colors. 225-235
  
• David Haussler:
  Another generalization of Higman's well quasi order result on Sigma^*. 237-243
  
• Glenn Hopkins, William Staton:
  Graphs with unique maximum independent sets. 245-251
  
• Sóstenes Lins:
  A simple proof of Gagliardi's handle recognition theorem. 253-260
  
• Sóstenes Lins, Arnaldo Mandel:
  Graph-encoded 3-manifolds. 261-284
  
• Hannu Tarnanen:
  On character sums and codes. 285-295
  
• Dominique Buset:
  Orbits on vertices and edges of finite graphs. 297-299
  
• Alphonse Baartmans, Mohan S. Shrikhande:
  A characterization of the extensions of symmetric designs. 301-305
  
• Bhaskar Bagchi, N. S. Narasimha Sastry:
  Minimum weight words of binary codes associated with finite projective geometries. 307-310
  
• Aleksander Torgasev:
  On graphs with a fixed number of negative eigenvalues. 311-317
  

Last update Thu May 23 18:41:10 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page