Table Of Content

DISCRETE MATHEMATICS VOLUME 125, NUMBERS 1-3, 15 FEBRUARY 1994 CONTENTS Preface |. Anderson and N.J. Finizio Cyclic Whist tournaments M. Anthony On the mean chromatic number C.A. Barefoot, L.H. Clark, A.J. Depew, R.C. Entringer and L.A. Székely Subdivision thresholds for two classes of graphs O. Barr On extremal graphs without compatible triangles or quadrilaterals L.W. Beineke, P. Hamburger and W.D. Goddard Random packings of graphs H. Bencherif Ait- Djafer On cycle lengths in graphs of moderate degree J. Bierbrauer A family of perpendicular arrays achieving perfect 4-fold secrecy A. Bowler Generalised Bhaskar Rao designs over non-Abelian groups H. Brandes, H. Harborth, H.-D.O.F. Gronau and C. Schwahn Ramsey numbers for sets of small graphs G. Brightwell Linear extensions of random orders P.J. Cameron An orbit theorem for Steiner triple systems Y. Caro, |. Krasikov and Y. Roditty On induced subgraphs of trees, with restricted degrees 101 W.-K. Chan, M.-K. Siu and S.-L. Ma Nonexistence of certain perfect arrays 107 G.J. Chang The domatic number problem 115 W.W. Chernoff Permutations with P’-th roots 123 C. Christofi Enumerating 4 x 5 and 5x6 double Youden rectangles 129 E.J. Cockayne, G. MacGillivray and C.M. Mynhardt Convexity of minimal dominating functions of trees — II 137 O. Favaron and J.L. Fouquet On m-centers in P,-free graphs 147 A. Finbow, B. Hartnell and C. Whitehead A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets 153 M.A. Fiol and J. Fabrega On the distance connectivity of graphs and digraphs 169 W. Goddard and D.J. Kleitman An upper bound for the Ramsey numbers r( K3, G) 177 M.J. Grannell and T.S. Griggs A Steiner system S(5, 6,108) 183 P.P. Greenough and R. Hill Optimal linear codes over GF(4) 187 H. Gropp On symmetric spatial configurations 201 H.R. Hind Recent developments in total colouring 211 C. Hoede and X. Li Clique polynomials and independent set polynomials of graphs 219 |. Honkala On the normality of multiple covering codes 229 J. Jedwab, C. Mitchell, F. Piper and P. Wild Perfect binary arrays and difference sets 241 M. Lewin On the coefficients of the characteristic polynomial of a matrix 255 S.L. Ma On subsets of partial difference sets 263 N. Martin Solving a conjecture of Sediacek: maximal edge sets in the 3-uniform sumset hypergraphs 273 C.J.H. McDiarmid and J. Ramirez Alfonsin Sharing jugs of wine 279 B. Peroche and C. Virlouvet Minimally 4-edge* -connected graphs 289 M.D. Plummer Extending matchings in claw-free graphs 301 D.A. Preece Double Youden rectangles — and update with examples of size 5 x 11 309 D.A. Preece, P.W. Brading, C.W.H. Lam and M. Cété Balanced 6 x 6 designs for 4 equally replicated treatments 319 N. Ray and W. Schmitt Ultimate chromatic polynomials 329 I. Schiermeyer The k-SATISFIABILITY problem remains NP-complete for dense families 343 J. Sheehan Graphical decompositions 347 L. Storme and J.A. Thas k-Arcs and dual k-arcs 357 E. Triesch A probabilistic upper bound for the edge identification complexity of graphs 371 Z. Tuza Monochromatic coverings and tree Ramsey numbers 377 B. Vowden Infinite series of double Youden rectangles 385 C. Wang On the A-sequenceability of dicyclic groups 393 Y. Yang and P. Rowlinson The third Ramsey numbers for graphs with at most four edges 399 Research problems 407 Author index to volume 125