The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1983, volume: 47, number:

  1. D. Borkovitz, F. K. Hwang
    Multiplicative magic squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:1-11 [Journal]
  2. Cai Mao-cheng
    Solutions to Edmonds' and Katona's problems on families of separating subsets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:13-21 [Journal]
  3. Amanda G. Chetwynd, H. P. Yap
    Chromatic index critical graphs of order 9. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:23-33 [Journal]
  4. Manfred Droste
    Products of conjugacy classes of the infinite symmetric groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:35-48 [Journal]
  5. Paul Erdös, Ronald C. Mullin, Vera T. Sós, Douglas R. Stinson
    Finite linear spaces and projective planes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:49-62 [Journal]
  6. Peter C. Fishburn
    Interval lengths for interval orders: A minimization problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:63-82 [Journal]
  7. Wen-Ching Winnie Li
    Determination of the residue classes of a polynomial at integral arguments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:83-90 [Journal]
  8. Michael Plantholt
    The chromatic index of graphs with large maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:91-96 [Journal]
  9. Bernd Voigt
    Combinatorial properties of regressive mappings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:97-108 [Journal]
  10. N. Hegde, R. C. Read, M. R. Sridharan
    The enumeration of transitive self-complementary digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:109-112 [Journal]
  11. Mikio Kano, Akira Saito
    [a, b]-factors of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:113-116 [Journal]
  12. George Mills
    A quintessential proof of van der Waerden's theorem on arithmetic progressions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:117-120 [Journal]
  13. Cees Roos
    A note on the existence of perfect constant weight codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:121-123 [Journal]
  14. Douglas R. Stinson, W. D. Wallis
    Two-fold triple systems without repeated blocks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:125-128 [Journal]
  15. Zoltán Füredi
    On finite set-systems whose every intersection is a Kernel of a star. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:129-132 [Journal]
  16. Rudolf Ahlswede, Klaus-Uwe Koschnick
    Note on an extremal problem arising for unreliable networks in parallel computing. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:137-152 [Journal]
  17. Douglas Bauer, Frank Harary, Juhani Nieminen, Charles L. Suffel
    Domination alteration sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:153-161 [Journal]
  18. Carlo Bernasconi
    Smooth designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:163-168 [Journal]
  19. Vasanti N. Bhat-Nayak, Ranjan N. Naik
    Solutions of some further graph equations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:169-175 [Journal]
  20. Andries E. Brouwer, Pierre Duchet, Alexander Schrijver
    Graphs whose neighborhoods have no special cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:177-182 [Journal]
  21. Charalambos A. Charalambides, M. Koutras
    On the differences of the generalized factorials at an arbitrary point and their combinatorial applications. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:183-201 [Journal]
  22. Anne Delandtsheer
    The rigidity of the smallest unknown pi-space. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:203-210 [Journal]
  23. Duane Detemple, Jack M. Robertson
    Permutations associated with billiard paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:211-219 [Journal]
  24. Jeffrey H. Dinitz, Douglas R. Stinson, W. D. Wallis
    Room squares with holes of sides 3, 5, and 7. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:221-228 [Journal]
  25. Konrad Engel
    Strong properties in partially ordered sets I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:229-234 [Journal]
  26. Michael Hager
    On Halin-lattices in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:235-246 [Journal]
  27. Charles A. Jones
    Using linear forms to determine the set of integers realizable by (g0, g1, ..., gn)-trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:247-254 [Journal]
  28. Philip J. Laufer, Jean M. Turgeon
    On a conjecture of Paul Erdös for perfect systems of difference sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:255-266 [Journal]
  29. Claudio L. Lucchesi, Jeffrey A. Ross
    Superfluous paths in strong digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:267-273 [Journal]
  30. A. Panayotopoulos
    Some considerations on permutation trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:275-281 [Journal]
  31. Michael von Rimscha
    Reconstructibility and perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:283-291 [Journal]
  32. Christian Ronse
    A generalization of the perfect shuffle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:293-306 [Journal]
  33. Ronny Rousseau
    Representations of a sublattice of the partition lattice on a lattice. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:307-314 [Journal]
  34. Patrice Assouad
    Binary contraction of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:315-319 [Journal]
  35. Roland Häggkvist, P.-O. Lindberg, B. Lindström
    Dissecting a square into rectangles of equal area. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:47, n:, pp:321-323 [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