Discrete Mathematics, Volume 163

Volume 163, Numbers 1-3, January 1997

• Dimitris Alevras:
  Order preserving assignments without contiguity. 1-11
  
• Desiree A. Beck:
  The combinatorics of symmetric functions and permutation enumeration of the hyperoctahedral group. 13-45
  
• Alewyn P. Burger, Ernest J. Cockayne, Christina M. Mynhardt:
  Domination and irredundance in the queens' graph. 47-66
  
• Franz B. Kalhoff:
  On projective embeddings of partial planes and rank-three matroids. 67-79
  
• Martin Klazar:
  On well quaasiordering of finite languages. 81-88
  
• Benoit Larose, László Zádori:
  Algebraic properties and dismantlability of finite posets. 89-99
  
• Xueliang Li:
  A lower bound for the connectivity of directed Euler tour transformation graphs. 101-108
  
• Erich Prisner:
  Radius versus diameter in cocomparability and intersection graphs. 109-117
  
• Talmage James Reid, Lee Inmon Virden:
  On rounded five-element lines of matroids. 119-127
  
• Mario Salvetti, Fabio Stumbo:
  Artin groups associated to infinite Coxeter groups. 129-138
  
• Grzegorz Stachowiak:
  Finding parity difference by involutions. 139-151
  
• Zhi-Hong Sun:
  Congruences for Bernoulli numbers and Bernoulli polynomials. 153-163
  
• Yuh-Jiuan Tsay, Gerard J. Chang:
  The exact gossiping problem. 165-172
  
• Peng-Jun Wan, Ding-Zhu Du:
  A (log₂3+1/2) competitive algorithm for the counterfeit coin problem. 173-200
  
• Stefan Janaqi, Charles Payan:
  Une caracterisation des produits d'arbres et des grilles. 201-208
  
• Dragan M. Acketa, Vojislav Mudrinski:
  Two 5-designs on 32 points. 209-210
  
• Hacène Aït Haddadène, Frédéric Maffray:
  Coloring perfect degenerate graphs. 211-215
  
• Jørgen Bang-Jensen, Gregory Gutin:
  Vertex heaviest paths and cycles in quasi-transitive digraphs. 217-223
  
• Aart Blokhuis, Andries E. Brouwer:
  Determination of the distance-regular graphs without 3-claws. 225-227
  
• Alberto Borobia:
  Vertices of the generalized transitive tournament polytype. 229-234
  
• John S. Caughman IV:
  Intersection numbers of bipartite distance-regular graphs. 235-241
  
• Guantao Chen:
  A result on C₄-star Ramsey numbers. 243-246
  
• Zhi-Hong Chen:
  The size of graphs with clique number m and without nowhere-zero 4-flows. 247-249
  
• Péter L. Erdös:
  Splitting property in infinite posets. 251-256
  
• Weidong Gao:
  An addition theorem for finite cyclic groups. 257-265
  
• Weidong Gao:
  On the number of zero sum subsequences. 267-273
  
• Barry Guiduli:
  On incidence coloring and star arboricity of graphs. 275-278
  
• Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak:
  Graphs without short odd cycles are nearly bipartite. 279-284
  
• Keyi Xing, Junming Li:
  On Srivastava's problems and the properties of Hadamard matrices. 285-291
  
• Chun-Wa Ko, Jon Lee, Einar Steingrímsson:
  The volume of relaxed Boolean-quadric and cut polytopes. 293-298
  
• Alexandr V. Kostochka, Jan Kratochvíl:
  Covering and coloring polygon-circle graphs. 299-305
  
• Josef Lauri:
  On a formula for the number of Euler trails for a class of digraphs. 307-312
  
• Jenö Lehel:
  The partition of a uniform hypergraph into pairs of dependent hyperedges. 313-318
  
• Iain A. Stewart:
  On locating cubic subgraphs in bounded-degree connected bipartite graphs. 319-324
  
• Raphael Yuster:
  On packing trees into complete bipartite graphs. 325-327