Discrete Mathematics, Volume 239

Volume 239, Number 1-3, August 2001

• Tara S. Holm:
  On majority domination in graphs. 1-12
  
• Karina Marcus, András Sebö:
  Integer multiflows and metric packings beyond the cut condition. 13-31
  
• Erich Neuwirth:
  Recursively defined combinatorial functions: extending Galton's board. 33-51
  
• Jean-Luc Rullière, Stéphan Thomassé:
  Countable alpha-extendable graphs. 53-67
  
• Yan Wang, Bolian Liu:
  The sum number and integral sum number of complete bipartite graphs. 69-82
  
• Rudolf Winkel:
  A combinatorial derivation of the Poincare' polynomials of the finite irreducible Coxeter groups. 83-99
  
• Arie Bialostocki, William Voxman:
  Generalizations of some Ramsey-type theorems for matchings. 101-107
  
• Ezra Brown, Theresa P. Vaughan:
  Cycles of directed graphs defined by matrix multiplication (mod n). 109-120
  
• Masaaki Harada:
  An extremal ternary self-dual [28, 14, 9] code with a trivial automorphism group. 121-125
  
• Jochen Harant, Mirko Hornák, Zdzislaw Skupien:
  Separating 3-cycles in plane triangulations. 127-136
  
• Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu:
  The integral sum number of complete bipartite graphs K_{r, s}. 137-146
  
• Dhruv Mubayi, Todd G. Will, Douglas B. West:
  Realizing degree imbalances in directed graphs. 147-153
  
• Artem V. Pyatkin:
  New formula for the sum number for the complete bipartite graphs. 155-160
  
• Romeo Rizzi:
  On the recognition of P₄-indifferent graphs. 161-169
  
• Sara Nadiv Soffer:
  Graphs with many large degrees. 171-177
  
• Baogen Xu:
  On signed edge domination numbers of graphs. 179-189
  
• Jian-Zhou Zhang, Zhi-Sheng You, Zheng-Liang Li:
  Enumeration of binary orthogonal arrays of strength 1. 191-198