Journals in DBLP

Discrete Mathematics
2010, volume: 310, number: 1

1. 
   Magic determinants of Somos sequences and theta functions. [Citation Graph (, )][DBLP]
   
   
2. 
   Optimal 1-planar graphs which triangulate other surfaces. [Citation Graph (, )][DBLP]
   
   
3. 
   On the distances of cyclic codes of length 2^e over Z₄. [Citation Graph (, )][DBLP]
   
   
4. 
   Polychromatic colorings of arbitrary rectangular partitions. [Citation Graph (, )][DBLP]
   
   
5. 
   On the interlace polynomials of forests. [Citation Graph (, )][DBLP]
   
   
6. 
   Diameter and connectivity of 3-arc graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   On the classification of perfect codes: Extended side class structures. [Citation Graph (, )][DBLP]
   
   
8. 
   On k-minimum and m-minimum edge-magic injections of graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   On the asymptotic behavior of graphs determined by their generalized spectra. [Citation Graph (, )][DBLP]
   
   
10. 
    On the transversal number and VC-dimension of families of positive homothets of a convex body. [Citation Graph (, )][DBLP]
    
    
11. 
    Dixon's ₃F₂(1)-series and identities involving harmonic numbers and the Riemann zeta function. [Citation Graph (, )][DBLP]
    
    
12. 
    Internally 4-connected binary matroids with cyclically sequential orderings. [Citation Graph (, )][DBLP]
    
    
13. 
    Total palindrome complexity of finite words. [Citation Graph (, )][DBLP]
    
    
14. 
    Fractional set systems with few disjoint pairs. [Citation Graph (, )][DBLP]
    
    
15. 
    Turán's theorem inverted. [Citation Graph (, )][DBLP]
    
    
16. 
    Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. [Citation Graph (, )][DBLP]
    
    
17. 
    Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. [Citation Graph (, )][DBLP]
    
    
18. 
    Uniformly optimal graphs in some classes of graphs with node failures. [Citation Graph (, )][DBLP]
    
    
19. 
    Planar graphs without adjacent cycles of length at most seven are 3-colorable. [Citation Graph (, )][DBLP]
    
    
20. 
    Partial duality and Bollobás and Riordan's ribbon graph polynomial. [Citation Graph (, )][DBLP]
    
    
21. 
    Representing (0, 1)-matrices by boolean circuits. [Citation Graph (, )][DBLP]
    
    
22. 
    A generalization of the Erdös-Ko-Rado theorem. [Citation Graph (, )][DBLP]
    
    
23. 
    A note on vertex-transitive non-Cayley graphs from Cayley graphs generated by involutions. [Citation Graph (, )][DBLP]