Journals in DBLP

Discrete Mathematics
2008, volume: 308, number: 13

1. 
   Combinatorial Designs: A tribute to Jennifer Seberry on her 60th Birthday. [Citation Graph (, )][DBLP]
   
   
2. 
   On c-Bhaskar Rao Designs and tight embeddings for path designs. [Citation Graph (, )][DBLP]
   
   
3. 
   Group divisible designs with block size four and two groups. [Citation Graph (, )][DBLP]
   
   
4. 
   Resolvable balanced incomplete block designs with subdesigns of block size 4. [Citation Graph (, )][DBLP]
   
   
5. 
   Construction of optimal ternary constant weight codes via Bhaskar Rao designs. [Citation Graph (, )][DBLP]
   
   
6. 
   Constructing strength three covering arrays with augmented annealing. [Citation Graph (, )][DBLP]
   
   
7. 
   On skew-Hadamard matrices. [Citation Graph (, )][DBLP]
   
   
8. 
   Steiner triple systems of order 19 and 21 with subsystems of order 7. [Citation Graph (, )][DBLP]
   
   
9. 
   On affine designs and Hadamard designs with line spreads. [Citation Graph (, )][DBLP]
   
   
10. 
    Large forbidden trade volumes and edge packings of random graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Strong edge-magic graphs of maximum size. [Citation Graph (, )][DBLP]
    
    
12. 
    Relative difference sets fixed by inversion (III) - Cocycle theoretical approach. [Citation Graph (, )][DBLP]
    
    
13. 
    On left Hadamard transversals in non-solvable groups. [Citation Graph (, )][DBLP]
    
    
14. 
    Some open combinatorial problems in the design of stated choice experiments. [Citation Graph (, )][DBLP]
    
    
15. 
    Classification of partitions of all triples on ten points into copies of Fano and affine planes. [Citation Graph (, )][DBLP]
    
    
16. 
    All triples for orthogonal designs of order 40. [Citation Graph (, )][DBLP]
    
    
17. 
    Study of proper circulant weighing matrices with weight 9. [Citation Graph (, )][DBLP]
    
    
18. 
    Graphs of order two less than the Moore bound. [Citation Graph (, )][DBLP]
    
    
19. 
    Maximal sets of hamilton cycles in K_2p-F. [Citation Graph (, )][DBLP]
    
    
20. 
    When is a partial Latin square uniquely completable, but not its completable product? [Citation Graph (, )][DBLP]
    
    
21. 
    Resolvable gregarious cycle decompositions of complete equipartite graphs. [Citation Graph (, )][DBLP]
    
    
22. 
    Two applications of relative difference sets: Difference triangles and negaperiodic autocorrelation functions. [Citation Graph (, )][DBLP]
    
    
23. 
    Permutation decoding for binary codes from lattice graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    Power Hadamard matrices. [Citation Graph (, )][DBLP]
    
    
25. 
    Blocker sets, orthogonal arrays and their application to combination locks. [Citation Graph (, )][DBLP]
    
    
26. 
    On the range of influences in back-circulant Latin squares. [Citation Graph (, )][DBLP]
    
    
27. 
    All graphs with maximum degree three whose complements have 4-cycle decompositions. [Citation Graph (, )][DBLP]
    
    
28. 
    On the automorphisms of Paley's type II Hadamard matrix. [Citation Graph (, )][DBLP]