The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1993, volume: 120, number: 1-3

  1. Shreeram S. Abhyankar
    Wreath products and enlargements of groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:1-12 [Journal]
  2. Ron Aharoni, Irith Ben-Arroyo Hartman
    On Greene-Kleitman's theorem for general digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:13-24 [Journal]
  3. Neal Brand, Somporn Sutinuntopas
    One-factors and the existence of affine designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:25-35 [Journal]
  4. J. W. Breckenridge, K. Varadarajan, K. H. Wehrhahn
    Chains, multichains and Möbius numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:37-50 [Journal]
  5. Anka Golemac
    Construction of new symmetric designs with parameters (70, 24, 8). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:51-58 [Journal]
  6. Bradley S. Gubser
    Planar graphs with no 6-wheel minor. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:59-73 [Journal]
  7. Olof Heden
    Maximal partial spreads and the modular n-queen problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:75-91 [Journal]
  8. Michael A. Henning, Henda C. Swart
    Bounds relating generalized domination parameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:93-105 [Journal]
  9. Alexander V. Ivashchenko
    The coordinate representation of a graph and n-universal graph of radius 1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:107-114 [Journal]
  10. Hadi Kharaghani
    A construction for Hadamard matrices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:115-120 [Journal]
  11. Yaakov S. Kupitz
    On the existence of a combinatorial Schlegel diagram of a simplical unstacked 3-polytope with a prescribed set of vertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:121-134 [Journal]
  12. Esther R. Lamken, Scott A. Vanstone
    Existence results for doubly near resolvable (upsilon, 3, 2)-BIBDs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:135-148 [Journal]
  13. Helmut Prodinger
    How to select a loser. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:149-159 [Journal]
  14. László Pyber, Zsolt Tuza
    Menger-type theorems with restrictions on path lengths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:161-174 [Journal]
  15. Richard P. Stanley
    A combinatorial decomposition of acyclic simplicial complexes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:175-182 [Journal]
  16. Jianji Su
    On locally k-critically n-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:183-190 [Journal]
  17. W. D. Wallis, Guo-Hui Zhang
    On the partition and coloring of a graph by cliques. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:191-203 [Journal]
  18. C. Kenneth Fan
    Matchings and the sum function. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:205-209 [Journal]
  19. Frédéric Maire
    A characterization of intersection graphs of the maximal rectangles of a polyomino. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:211-214 [Journal]
  20. Margit Voigt
    List colourings of planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:215-219 [Journal]
  21. Cheng-De Wang
    On the harmoniousness of dicyclic groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:221-225 [Journal]
  22. Martin Anthony, Norman Biggs
    The mean chromatic number of paths and cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:227-231 [Journal]
  23. Xiaomin Bao
    A constructing method of a class of SIDS(n). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:233-239 [Journal]
  24. Andries E. Brouwer, Jacobus H. Koolen
    A new infinite series of regular uniformly geodetic code graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:241-247 [Journal]
  25. I. M. Chakravarti
    A three-class association scheme on the flags of a finite projective plane and a (PBIB) design defined by the incidence of the flags and the Baer subplanes in PG(2, q2). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:249-252 [Journal]
  26. C. R. J. Clapham, J. Sheehan
    All trees are 1-embeddable and all except stars are 2-embeddable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:253-259 [Journal]
  27. James A. Davis
    New constructions of divisible designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:261-268 [Journal]
  28. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka
    Covering boxes by points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:269-275 [Journal]
  29. Yaakov S. Kupitz
    On convex segments in a triangulation. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:277-285 [Journal]
  30. Daniel Q. Naiman, Henry P. Wynn
    A theorem on independence. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:287-289 [Journal]
  31. Angelika Steger, Min-Li Yu
    On induced matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:291-295 [Journal]
  32. Xie-Hua Sun
    On Rota's problem of the explicit representation for umbral operators. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:297-300 [Journal]
  33. Linda Valdes
    On the divisibility of the cycle number by 7. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:301-305 [Journal]
  34. Hong Wang
    P2p-factorization of a complete bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:307-308 [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