The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2006, volume: 306, number: 12

  1. Ahmed Ainouche, Serge Lapiquonne
    Hamilton connectedness and the partially square graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1097-1104 [Journal]
  2. G. Ambrus, János Barát
    A contribution to queens graphs: A substitution method. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1105-1114 [Journal]
  3. Fethi Ben Saïd, Houda Lahouar, Jean-Louis Nicolas
    On the counting function of the sets of parts A such that the partition function p(A, n) takes even values for n large enough. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1115-1125 [Journal]
  4. Simon R. Blackburn, Igor Shparlinski
    Character sums and nonlinear recurrence sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1126-1131 [Journal]
  5. Chiuyuan Chen, Chih-Shin Hung, Wen-Shiang Tang
    On the existence of hyper-L triple-loop networks. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1132-1138 [Journal]
  6. Ming-You Chen, Frank K. Hwang, Chih-Hung Yen
    Tessellating polyominos in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1139-1144 [Journal]
  7. Nicolas Lichiardopol
    Independence number of de Bruijn graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1145-1160 [Journal]
  8. Toufik Mansour
    Restricted even permutations and Chebyshev polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1161-1176 [Journal]
  9. Romeo Rizzi
    Acyclically pushable bipartite permutation digraphs: An algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1177-1188 [Journal]
  10. Ngo Dac Tuan
    Hypergraphical t-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1189-1197 [Journal]
  11. Lutz Volkmann
    On cycles in regular 3-partite tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1198-1206 [Journal]
  12. Aifeng Yang, Jinjiang Yuan
    Partition the vertices of a graph into one independent set and one acyclic set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1207-1216 [Journal]
  13. Roger K. Yeh
    A survey on labeling graphs with a condition at distance two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1217-1231 [Journal]
  14. Edwin Soedarmadji
    Latin hypercubes and MDS codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1232-1239 [Journal]
  15. H. Cao
    Resolvable packings RtildeMP(3, 2; n, n-3) and coverings RtildeMC(3, 2; n, n-2). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1240-1246 [Journal]
  16. S. Panma, N. Na Chiangmai, Ulrich Knauer, Sr. Arworn
    Characterizations of Clifford semigroup digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1247-1252 [Journal]
  17. Daniel C. Slilaty
    Bias matroids with unique graphical representations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:12, pp:1253-1256 [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