The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1994, volume: 125, number: 1-3

  1. Douglas Woodwall
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:1-3 [Journal]
  2. Ian Anderson, Norman J. Finizio
    Cyclic whist tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:5-10 [Journal]
  3. Martin Anthony
    On the mean chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:11-14 [Journal]
  4. Curtis A. Barefoot, L. H. Clark, A. J. Depew, Roger C. Entringer, László A. Székely
    Subdivision thresholds for two classes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:15-30 [Journal]
  5. Olof Barr
    On extremal graphs without compatible triangles or quadrilaterals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:31-43 [Journal]
  6. Lowell W. Beineke, Peter Hamburger, Wayne Goddard
    Random packings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:45-54 [Journal]
  7. H. Bencherif Ait-Djafer
    On cycle lengths in graphs of moderate degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:55-62 [Journal]
  8. Jürgen Bierbrauer
    A family of perpendicular arrays achieving perfect 4-fold secrecy. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:63-66 [Journal]
  9. Andrew Bowler
    Generalised Bhaskar Rao designs over non-Abelian groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:67-72 [Journal]
  10. Holger Brandes, Heiko Harborth, Hans-Dietrich O. F. Gronau, Christian Schwahn
    Ramsey numbers for sets of small graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:73-86 [Journal]
  11. Graham Brightwell
    Linear extensions of random orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:87-96 [Journal]
  12. Peter J. Cameron
    An orbit theorem for Steiner triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:97-100 [Journal]
  13. Yair Caro, Ilia Krasikov, Yehuda Roditty
    On induced subgraphs of trees, with restricted degrees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:101-106 [Journal]
  14. Wai-Kiu Chan, Man-Keung Siu, Siu-Lun Ma
    Nonexistence of certain perfect arrays. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:107-113 [Journal]
  15. Gerald J. Chang
    The domatic number problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:115-122 [Journal]
  16. William W. Chernoff
    Permutations with pl-th roots. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:123-127 [Journal]
  17. C. Christofi
    Enumerating 4 x 5 and 5 x 6 double Youden rectangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:129-135 [Journal]
  18. Ernest J. Cockayne, Gary MacGillivray, Christina M. Mynhardt
    Convexity of minimal dominating functions of trees - II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:137-146 [Journal]
  19. Odile Favaron, Jean-Luc Fouquet
    On m-centers in Pt-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:147-152 [Journal]
  20. Art S. Finbow, Bert Hartnell, Carol Whitehead
    A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:153-167 [Journal]
  21. Miguel Angel Fiol, Josep Fàbrega
    On the distance connectivity of graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:169-176 [Journal]
  22. Wayne Goddard, Daniel J. Kleitman
    An upper bound for the Ramsey numbers r(K3, G). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:177-182 [Journal]
  23. Mike J. Grannell, Terry S. Griggs
    A Steiner system S(5, 6, 108). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:183-186 [Journal]
  24. P. P. Greenough, R. Hill
    Optimal linear codes over GF(4). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:187-199 [Journal]
  25. Harald Gropp
    On symmetric spatial configurations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:201-209 [Journal]
  26. H. R. Hind
    Recent developments in total colouring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:211-218 [Journal]
  27. Cornelis Hoede, Xueliang Li
    Clique polynomials and independent set polynomials of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:219-228 [Journal]
  28. Iiro S. Honkala
    On the normality of multiple covering codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:229-239 [Journal]
  29. Jonathan Jedwab, Chris J. Mitchell, Fred Piper, Peter R. Wild
    Perfect binary arrays and difference sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:241-254 [Journal]
  30. Mordechai Lewin
    On the coefficients of the characteristic polynomial of a matrix. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:255-262 [Journal]
  31. S. L. Ma
    On subsets of partial difference sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:263-272 [Journal]
  32. Nigel Martin
    Solving a conjecture of Sedlacek: maximal edge sets in the 3-uniform sumset hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:273-277 [Journal]
  33. Colin J. H. McDiarmid, Jorge Ramirez Alfonsin
    Sharing jugs of wine. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:279-287 [Journal]
  34. Bernard Peroche, Christine Virlouvet
    Minimally 4-edge# -connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:289-299 [Journal]
  35. Michael D. Plummer
    Extending matchings in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:301-307 [Journal]
  36. Donald A. Preece
    Double Youden rectangles - an update with examples of size 5x11. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:309-317 [Journal]
  37. D. A. Preece, P. W. Brading, C. W. H. Lam, M. Côté
    Balanced 6 × 6 designs for 4 equally replicated treatments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:319-327 [Journal]
  38. Nigel Ray, William Schmitt
    Ultimate chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:329-341 [Journal]
  39. Ingo Schiermeyer
    The k-Satisfiability problem remains NP-complete for dense families. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:343-346 [Journal]
  40. J. Sheehan
    Graphical decompositions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:347-355 [Journal]
  41. Leo Storme, Joseph A. Thas
    k-Arcs and dual k-arcs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:357-370 [Journal]
  42. Eberhard Triesch
    A probabilistic upper bound for the edge identification complexity of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:371-376 [Journal]
  43. Zsolt Tuza
    Monochromatic coverings and tree Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:377-384 [Journal]
  44. Barry Vowden
    Infinite series of double Youden rectangles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:385-391 [Journal]
  45. Chengde Wang
    On the R-sequenceability of dicyclic groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:393-398 [Journal]
  46. Yuansheng Yang, Peter Rowlinson
    The third Ramsey numbers for graphs with at most four edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:125, n:1-3, pp:399-406 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002