Discrete Mathematics, Volume 125

Volume 125, Numbers 1-3, February 1994

• Douglas Woodwall:
  Preface. 1-3
  Electronic Edition (link) BibTeX
• Ian Anderson, Norman J. Finizio:
  Cyclic whist tournaments. 5-10
  Electronic Edition (link) BibTeX
• Martin Anthony:
  On the mean chromatic number. 11-14
  Electronic Edition (link) BibTeX
• Curtis A. Barefoot, L. H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely:
  Subdivision thresholds for two classes of graphs. 15-30
  Electronic Edition (link) BibTeX
• Olof Barr:
  On extremal graphs without compatible triangles or quadrilaterals. 31-43
  Electronic Edition (link) BibTeX
• Lowell W. Beineke, Peter Hamburger, Wayne Goddard:
  Random packings of graphs. 45-54
  Electronic Edition (link) BibTeX
• H. Bencherif Ait-Djafer:
  On cycle lengths in graphs of moderate degree. 55-62
  Electronic Edition (link) BibTeX
• Jürgen Bierbrauer:
  A family of perpendicular arrays achieving perfect 4-fold secrecy. 63-66
  Electronic Edition (link) BibTeX
• Andrew Bowler:
  Generalised Bhaskar Rao designs over non-Abelian groups. 67-72
  Electronic Edition (link) BibTeX
• Holger Brandes, Heiko Harborth, Hans-Dietrich O. F. Gronau, Christian Schwahn:
  Ramsey numbers for sets of small graphs. 73-86
  Electronic Edition (link) BibTeX
• Graham Brightwell:
  Linear extensions of random orders. 87-96
  Electronic Edition (link) BibTeX
• Peter J. Cameron:
  An orbit theorem for Steiner triple systems. 97-100
  Electronic Edition (link) BibTeX
• Yair Caro, Ilia Krasikov, Yehuda Roditty:
  On induced subgraphs of trees, with restricted degrees. 101-106
  Electronic Edition (link) BibTeX
• Wai-Kiu Chan, Man-Keung Siu, Siu-Lun Ma:
  Nonexistence of certain perfect arrays. 107-113
  Electronic Edition (link) BibTeX
• Gerald J. Chang:
  The domatic number problem. 115-122
  Electronic Edition (link) BibTeX
• William W. Chernoff:
  Permutations with p^l-th roots. 123-127
  Electronic Edition (link) BibTeX
• C. Christofi:
  Enumerating 4 x 5 and 5 x 6 double Youden rectangles. 129-135
  Electronic Edition (link) BibTeX
• Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt:
  Convexity of minimal dominating functions of trees - II. 137-146
  Electronic Edition (link) BibTeX
• Odile Favaron, Jean-Luc Fouquet:
  On m-centers in P_t-free graphs. 147-152
  Electronic Edition (link) BibTeX
• Art S. Finbow, Bert Hartnell, Carol Whitehead:
  A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets. 153-167
  Electronic Edition (link) BibTeX
• Miguel Angel Fiol, Josep Fàbrega:
  On the distance connectivity of graphs and digraphs. 169-176
  Electronic Edition (link) BibTeX
• Wayne Goddard, Daniel J. Kleitman:
  An upper bound for the Ramsey numbers r(K₃, G). 177-182
  Electronic Edition (link) BibTeX
• Mike J. Grannell, Terry S. Griggs:
  A Steiner system S(5, 6, 108). 183-186
  Electronic Edition (link) BibTeX
• P. P. Greenough, R. Hill:
  Optimal linear codes over GF(4). 187-199
  Electronic Edition (link) BibTeX
• Harald Gropp:
  On symmetric spatial configurations. 201-209
  Electronic Edition (link) BibTeX
• H. R. Hind:
  Recent developments in total colouring. 211-218
  Electronic Edition (link) BibTeX
• Cornelis Hoede, Xueliang Li:
  Clique polynomials and independent set polynomials of graphs. 219-228
  Electronic Edition (link) BibTeX
• Iiro S. Honkala:
  On the normality of multiple covering codes. 229-239
  Electronic Edition (link) BibTeX
• Jonathan Jedwab, Chris J. Mitchell, Fred Piper, Peter R. Wild:
  Perfect binary arrays and difference sets. 241-254
  Electronic Edition (link) BibTeX
• Mordechai Lewin:
  On the coefficients of the characteristic polynomial of a matrix. 255-262
  Electronic Edition (link) BibTeX
• S. L. Ma:
  On subsets of partial difference sets. 263-272
  Electronic Edition (link) BibTeX
• Nigel Martin:
  Solving a conjecture of Sedlacek: maximal edge sets in the 3-uniform sumset hypergraphs. 273-277
  Electronic Edition (link) BibTeX
• Colin J. H. McDiarmid, Jorge Ramirez Alfonsin:
  Sharing jugs of wine. 279-287
  Electronic Edition (link) BibTeX
• Bernard Peroche, Christine Virlouvet:
  Minimally 4-edge^# -connected graphs. 289-299
  Electronic Edition (link) BibTeX
• Michael D. Plummer:
  Extending matchings in claw-free graphs. 301-307
  Electronic Edition (link) BibTeX
• Donald A. Preece:
  Double Youden rectangles - an update with examples of size 5x11. 309-317
  Electronic Edition (link) BibTeX
• D. A. Preece, P. W. Brading, Clement W. H. Lam, M. Côté:
  Balanced 6 × 6 designs for 4 equally replicated treatments. 319-327
  Electronic Edition (link) BibTeX
• Nigel Ray, William Schmitt:
  Ultimate chromatic polynomials. 329-341
  Electronic Edition (link) BibTeX
• Ingo Schiermeyer:
  The k-Satisfiability problem remains NP-complete for dense families. 343-346
  Electronic Edition (link) BibTeX
• J. Sheehan:
  Graphical decompositions. 347-355
  Electronic Edition (link) BibTeX
• Leo Storme, Joseph A. Thas:
  k-Arcs and dual k-arcs. 357-370
  Electronic Edition (link) BibTeX
• Eberhard Triesch:
  A probabilistic upper bound for the edge identification complexity of graphs. 371-376
  Electronic Edition (link) BibTeX
• Zsolt Tuza:
  Monochromatic coverings and tree Ramsey numbers. 377-384
  Electronic Edition (link) BibTeX
• Barry Vowden:
  Infinite series of double Youden rectangles. 385-391
  Electronic Edition (link) BibTeX
• Chengde Wang:
  On the R-sequenceability of dicyclic groups. 393-398
  Electronic Edition (link) BibTeX
• Yuansheng Yang, Peter Rowlinson:
  The third Ramsey numbers for graphs with at most four edges. 399-406
  Electronic Edition (link) BibTeX