Discrete Mathematics, Volume 162

Volume 162, Numbers 1-3, December 1996

• Jørgen Bang-Jensen, Gregory Gutin, Anders Yeo:
  On k-strong and k-cyclic digraphs. 1-11
  
• Gerhard Benadé, Izak Broere, Betsie Jonck, Marietjie Frick:
  Uniquely (m, k)^tau-colourable graphs and k-tau-saturated graphs. 13-22
  
• Frank E. Bennett, J. Yin:
  Packings and coverings of the complete directed multigraph with 3- and 4-circuits. 23-29
  
• Béla Bollobás, Imre Leader:
  Sums in the grid. 31-48
  
• Mihai Caragui:
  On a class of finite upper half-planes. 49-66
  
• Zhibo Chen:
  On polynomial functions from Zn₁ × Zn₂ × ... × Zn_r to Zm. 67-76
  
• K. H. Chew:
  The chromatic index of graphs of high maximum degree. 77-91
  
• Feodor F. Dragan, Andreas Brandstädt:
  r-Dominating cliques in graphs with hypertree structure. 93-108
  
• Qingyan Du:
  Chromaticity of the complements of paths and cycles. 109-125
  
• Yahya Ould Hamidoune:
  On weighted sums in abelian groups. 127-132
  
• G. M. Hamilton, C. Ramsay, I. T. Roberts, D. G. Rogers:
  Uniform perfect systems of sets of iterated differences of size 4¹. 133-150
  
• Neil Hindman, Hanno Lefmann:
  Canonical partition relations for (m, p, c)-systems. 151-174
  
• F. T. Howard:
  Explicit formulas for degenerate Bernoulli numbers. 175-185
  
• Ferran Hurtado, Oriol Serra, Jorge Urrutia:
  Hiding points in arrangements of segments. 187-197
  
• Alexandr V. Kostochka:
  The total chromatic number of any multigraph with maximum degree five is at most seven. 199-214
  
• Wolfgang Kühnel, Gunter Lassmann:
  Permuted difference cycles and triangulated sphere bundles. 215-227
  
• Shahriar Shahriari:
  On the structure of maximum 2-part Sperner families. 229-238
  
• Jeffrey M. Vanderkam:
  Path-sequential labellings of cycles. 239-249
  
• Xiaoya Zha:
  Closed 2-cell embeddings of 4 cross-cap embeddable graphs. 251-266
  
• Ingo Althöfer, Matthias Löwe:
  Edge search in hypergraphs. 267-271
  
• Yong-Gao Chen:
  On m-harmonic sequences. 273-280
  
• G. L. Chia:
  On graphs uniquely colorable under the action of their automorphism groups. 281-284
  
• G. L. Chia:
  On the chromatic equivalence class of a family of graphs. 285-289
  
• P. Hoffmann:
  Counting maximal cycles in binary matroids. 291-292
  
• Bill Jackson, Nicholas C. Wormald:
  On the linear k-arboricity of cubic graphs. 293-297
  
• Alexandr V. Kostochka, Michael Stiebitz, B. Wirth:
  The colour theorems of Brooks and Gallai extended. 299-303
  
• Dieter Kratsch, Jean-Xavier Rampon:
  Width two posets are reconstructible. 305-310
  
• Anthony J. Macula:
  A simple construction of d-disjunct matrices with certain constant weights. 311-312
  
• Frédéric Maffray, Myriam Preissmann:
  On the NP-completeness of the k-colorability problem for triangle-free graphs. 313-317
  
• Tsuyoshi Nishimura, Akira Saito:
  Two recursive theorems on n-extendibility. 319-323