The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2006, volume: 306, number: 1

  1. Sukumar Das Adhikari, Yong-Gao Chen, John Friedlander, Sergei Konyagin, Francesco Pappalardi
    Contributions to zero-sum problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:1-10 [Journal]
  2. Tamara Burton, David P. Sumner
    Domination dot-critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:11-18 [Journal]
  3. Zhibo Chen
    On integral sum graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:19-25 [Journal]
  4. Matt DeVos, Rui Xu, Gexin Yu
    Nowhere-zero Z3-flows through Z3-connectivity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:26-30 [Journal]
  5. Melodie Fehr, Shonda Gosselin, Ortrud R. Oellermann
    The metric dimension of Cayley digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:31-41 [Journal]
  6. John C. Galati
    A group extensions approach to affine relative difference sets of even order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:42-51 [Journal]
  7. Gennian Ge
    Resolvable group divisible designs with block size four and index three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:52-65 [Journal]
  8. Seth Kleinerman
    Bounds on the forcing numbers of bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:66-73 [Journal]
  9. C. Y. Ku, Imre Leader
    An Erdös-Ko-Rado theorem for partial permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:74-86 [Journal]
  10. Weiqi Luo, Zhi-hong Chen, Wei-Guo Chen
    Spanning trails containing given edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:87-98 [Journal]
  11. E. Maistrelli, D. B. Penman
    Some colouring problems for Paley graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:99-106 [Journal]
  12. Primoz Potocnik, Mateja Sajna
    On almost self-complementary graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:107-123 [Journal]
  13. Yunqing Xu, Yanxun Chang
    Existence of r-self-orthogonal Latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:124-146 [Journal]
  14. Hiroyuki Nakasora
    A construction of non self-orthogonal designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:147-152 [Journal]
  15. Wasin So
    Integral circulant graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:153-158 [Journal]
  16. Jun-Ming Xu, Chao Yang
    Connectivity of Cartesian product graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:159-165 [Journal]
  17. Raphael Yuster
    Decomposing oriented graphs into transitive tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:1, pp:166-170 [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