The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2003, volume: 268, number: 1-3

  1. R. Julian R. Abel, Norman J. Finizio, Malcolm Greig, Scott J. Lewis
    Generalized whist tournament designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:1-19 [Journal]
  2. Jungmin Ahn, Hyun Kwang Kim, Jung Soo Kim, Mina Kim
    Classification of perfect linear codes with crown poset structure. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:21-30 [Journal]
  3. Maria Axenovich
    On multiple coverings of the infinite rectangular grid with balls of constant radius. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:31-48 [Journal]
  4. R. Balakrishnan, Jean-Claude Bermond, P. Paulraja, Min-Li Yu
    On Hamilton cycle decompositions of the tensor product of complete graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:49-58 [Journal]
  5. Andrei A. Bulatov, Pawel M. Idziak
    Counting Mal'tsev clones on small sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:59-80 [Journal]
  6. Marc Chastand
    Fiber-complemented graphs II. Retractions and endomorphisms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:81-101 [Journal]
  7. Iwan M. Duursma
    Extremal weight enumerators and ultraspherical polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:103-127 [Journal]
  8. Elaine M. Eschen, William Klostermeyer, R. Sritharan
    Planar domination graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:129-137 [Journal]
  9. Gennian Ge, Clement W. H. Lam
    Resolvable group divisible designs with block size four and group size six. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:139-151 [Journal]
  10. Clemens Heuberger
    On planarity and colorability of circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:153-169 [Journal]
  11. Darla Kremer, Wai Chee Shiu
    Finite transition matrices for permutations avoiding pairs of length four patterns. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:171-183 [Journal]
  12. Rao Li, Richard H. Schelp
    Every 3-connected distance claw-free graph is Hamilton-connected. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:185-197 [Journal]
  13. Xuechao Li, Cun-Quan Zhang
    Chords of longest circuits in 3-connected graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:199-206 [Journal]
  14. Seiya Negami
    Composite planar coverings of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:207-216 [Journal]
  15. Hidefumi Ohsugi, Takayuki Hibi
    Normalized volumes of configurations related with root systems and complete bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:217-242 [Journal]
  16. Erich Prisner
    The recognition problem for line bigraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:243-256 [Journal]
  17. J. K. Truss
    The automorphism group of the random graph: four conjugates good, three conjugates better. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:257-271 [Journal]
  18. Bao-Yin Zhang, Jie Li
    An improvement of the two-line algorithm for proving q-hypergeometric identities. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:273-286 [Journal]
  19. Chiuyuan Chen, Frank K. Hwang, J. S. Lee, S. J. Shih
    The existence of hyper-L triple-loop networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:287-291 [Journal]
  20. Gennian Ge, Clement W. H. Lam
    Bhaskar Rao designs with block size four. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:293-298 [Journal]
  21. Wayne Goddard, Michael A. Henning
    Nordhaus-Gaddum bounds for independent domination. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:299-302 [Journal]
  22. Sylvain Gravier, Frédéric Maffray, Bojan Mohar
    On a list-coloring problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:303-308 [Journal]
  23. Victor J. W. Guo
    A simple proof of Dixon's identity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:309-310 [Journal]
  24. Frank Kwang-Ming Hwang
    On Macula's error-correcting pool designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:311-314 [Journal]
  25. Hermann Mierendorff
    Magic twin body stars generated from chains of prismoids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:315-323 [Journal]
  26. Reza Naserasr, Riste Skrekovski
    The Petersen graph is not 3-edge-colorable--a new proof. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:325-326 [Journal]
  27. Micha Sharir, Shakhar Smorodinsky
    On neighbors in geometric permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:327-335 [Journal]
  28. Dong-Joon Shin, Wonjin Sung
    A new Kloosterman sum identity over F2m for odd m. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:337-341 [Journal]
  29. Lie Zhu, Hantao Zhang
    Completing the spectrum of r-orthogonal Latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:268, n:1-3, pp:343-349 [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