default search action
Discrete Mathematics, Volume 125
Volume 125, Numbers 1-3, February 1994
- Douglas Woodwall:
Preface. 1-3 - Ian Anderson, Norman J. Finizio:
Cyclic whist tournaments. 5-10 - Martin Anthony
:
On the mean chromatic number. 11-14 - Curtis A. Barefoot, Lane H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely:
Subdivision thresholds for two classes of graphs. 15-30 - Olof Barr:
On extremal graphs without compatible triangles or quadrilaterals. 31-43 - Lowell W. Beineke, Peter Hamburger, Wayne Goddard:
Random packings of graphs. 45-54 - H. Bencherif Ait-Djafer:
On cycle lengths in graphs of moderate degree. 55-62 - Jürgen Bierbrauer:
A family of perpendicular arrays achieving perfect 4-fold secrecy. 63-66 - Andrew Bowler:
Generalised Bhaskar Rao designs over non-Abelian groups. 67-72 - Holger Brandes, Heiko Harborth, Hans-Dietrich O. F. Gronau, Christian Schwahn:
Ramsey numbers for sets of small graphs. 73-86 - Graham R. Brightwell:
Linear extensions of random orders. 87-96 - Peter J. Cameron
An orbit theorem for Steiner triple systems. 97-100 - Yair Caro, Ilia Krasikov, Yehuda Roditty:
On induced subgraphs of trees, with restricted degrees. 101-106 - Wai-Kiu Chan, Man-Keung Siu, Siu Lun Ma:
Nonexistence of certain perfect arrays. 107-113 - Gerard J. Chang:
The domatic number problem. 115-122 - William W. Chernoff:
Permutations with pl-th roots. 123-127 - C. Christofi:
Enumerating 4 x 5 and 5 x 6 double Youden rectangles. 129-135 - Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
Convexity of minimal dominating functions of trees - II. 137-146 - Odile Favaron, Jean-Luc Fouquet:
On m-centers in Pt-free graphs. 147-152 - Art S. Finbow
A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets. 153-167 - Miguel Angel Fiol, Josep Fàbrega
On the distance connectivity of graphs and digraphs. 169-176 - Wayne Goddard, Daniel J. Kleitman:
An upper bound for the Ramsey numbers r(K3, G). 177-182 - Mike J. Grannell, Terry S. Griggs:
A Steiner system S(5, 6, 108). 183-186 - Phil P. Greenough, Ray Hill:
Optimal linear codes over GF(4). 187-199 - Harald Gropp:
On symmetric spatial configurations. 201-209 - H. R. Hind:
Recent developments in total colouring. 211-218 - Cornelis Hoede, Xueliang Li:
Clique polynomials and independent set polynomials of graphs. 219-228 - Iiro S. Honkala:
On the normality of multiple covering codes. 229-239 - Jonathan Jedwab, Chris J. Mitchell
Perfect binary arrays and difference sets. 241-254 - Mordechai Lewin:
On the coefficients of the characteristic polynomial of a matrix. 255-262 - Siu Lun Ma:
On subsets of partial difference sets. 263-272 - Nigel Martin:
Solving a conjecture of Sedlacek: maximal edge sets in the 3-uniform sumset hypergraphs. 273-277 - Colin J. H. McDiarmid, Jorge L. Ramírez Alfonsín:
Sharing jugs of wine. 279-287 - Bernard Peroche, Christine Virlouvet:
Minimally 4-edge# -connected graphs. 289-299 - Michael D. Plummer:
Extending matchings in claw-free graphs. 301-307 - Donald A. Preece:
Double Youden rectangles - an update with examples of size 5x11. 309-317 - Donald A. Preece, P. W. Brading, Clement W. H. Lam, Michel Côté
Balanced 6 × 6 designs for 4 equally replicated treatments. 319-327 - Nigel Ray, William Schmitt:
Ultimate chromatic polynomials. 329-341 - Ingo Schiermeyer:
The k-Satisfiability problem remains NP-complete for dense families. 343-346 - J. Sheehan:
Graphical decompositions. 347-355 - Leo Storme
k-Arcs and dual k-arcs. 357-370 - Eberhard Triesch:
A probabilistic upper bound for the edge identification complexity of graphs. 371-376 - Zsolt Tuza:
Monochromatic coverings and tree Ramsey numbers. 377-384 - Barry Vowden:
Infinite series of double Youden rectangles. 385-391 - Chengde Wang:
On the R-sequenceability of dicyclic groups. 393-398 - Yuansheng Yang, Peter Rowlinson
The third Ramsey numbers for graphs with at most four edges. 399-406
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-19 20:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: