The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2001, volume: 240, number: 1-3

  1. Jürgen Bierbrauer
    An infinite family of 7-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:1-11 [Journal]
  2. Galina T. Bogdanova, Patric R. J. Östergård
    Bounds on codes over an alphabet of five elements. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:13-19 [Journal]
  3. Chung-Haw Chang, Yen-Chu Chuang, Lih-Hsing Hsu
    Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:21-43 [Journal]
  4. Neil Hindman, Randall McCutcheon
    VIP systems in partial semigroups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:45-70 [Journal]
  5. Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito
    Hamiltonian cycles in n-factor-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:71-82 [Journal]
  6. André E. Kézdy, Matthew Scobee
    A proof of Hougardy's conjecture for diamond-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:83-95 [Journal]
  7. James F. Korsh
    Loopless generation of up-down permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:97-122 [Journal]
  8. Alexandr V. Kostochka, Douglas R. Woodall
    Choosability conjectures and multicircuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:123-143 [Journal]
  9. Salvatore Milici, Alex Rosa, Vitaly I. Voloshin
    Colouring Steiner systems with specified block colour patterns. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:145-160 [Journal]
  10. Donald Mills
    Factorizations of root-based polynomial compositions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:161-173 [Journal]
  11. Hiroshi Nagamochi, Mirka Miller, Slamin
    Bounds on the number of isolates in sum graph labeling. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:175-185 [Journal]
  12. Seiya Negami
    Diagonal flips in pseudo-triangulations on closed surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:187-196 [Journal]
  13. Michel Sebille
    An extension theorem for t-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:197-204 [Journal]
  14. Hsin-Min Sun
    Segments in a planar nearring. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:205-217 [Journal]
  15. Wang Yan, Bolian Liu
    Some results on integral sum graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:219-229 [Journal]
  16. S. Arumugam, Indra Rajasingh, P. Roushini Leely Pushpam
    Graphs whose acyclic graphoidal covering number is one less than its maximum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:231-237 [Journal]
  17. Richard A. Brualdi, Susan Hollingsworth
    Multicolored forests in complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:239-245 [Journal]
  18. Miranca Fischermann
    Block graphs with unique minimum dominating sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:247-251 [Journal]
  19. Shannon L. Fitzpatrick, Richard J. Nowakowski, Derek A. Holton, Ian Caines
    Covering hypercubes by isometric paths. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:253-260 [Journal]
  20. Qiongxiang Huang, An Chang
    Circulant digraphs determined by their spectra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:261-270 [Journal]
  21. Manoel Lemos
    On Mills's conjecture on matroids with many common bases. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:271-276 [Journal]
  22. Hossein Shahmohamad
    Some flow-equivalent planar and non-planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:277-280 [Journal]
  23. Masato Tomiyama
    On the primitive idempotents of distance-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:281-294 [Journal]
  24. Qin Wang, Jinjiang Yuan
    Maximal IM-unextendable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:295-298 [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