Journals in DBLP

Discrete Mathematics
2008, volume: 308, number: 15

1. 
   Wilf classification of three and four letter signed patterns. [Citation Graph (, )][DBLP]
   
   
2. 
   On minimally circular-imperfect graphs. [Citation Graph (, )][DBLP]
   
   
3. 
   The Laplacian spectral radii of trees with degree sequences. [Citation Graph (, )][DBLP]
   
   
4. 
   On Boolean primitive positive clones. [Citation Graph (, )][DBLP]
   
   
5. 
   Set partitions with restrictions. [Citation Graph (, )][DBLP]
   
   
6. 
   On the tightness of the I independence ratio. [Citation Graph (, )][DBLP]
   
   
7. 
   A sharp upper bound on the spectral radius of weighted graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   alpha-Domination perfect trees. [Citation Graph (, )][DBLP]
   
   
9. 
   Equivariant collapses and the homotopy type of iterated clique graphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Nonorientable triangular embeddings of complete graphs with arbitrarily large looseness. [Citation Graph (, )][DBLP]
    
    
11. 
    Total domination in claw-free graphs with minimum degree 2. [Citation Graph (, )][DBLP]
    
    
12. 
    Graph powers and k-ordered Hamiltonicity. [Citation Graph (, )][DBLP]
    
    
13. 
    Clique partitions of distance multigraphs. [Citation Graph (, )][DBLP]
    
    
14. 
    Domination dot-critical graphs with no critical vertices. [Citation Graph (, )][DBLP]
    
    
15. 
    On the connectivity of (k, g)-cages of even girth. [Citation Graph (, )][DBLP]
    
    
16. 
    A contraction of square transversal designs. [Citation Graph (, )][DBLP]
    
    
17. 
    Maximally edge-connected and vertex-connected graphs and digraphs: A survey. [Citation Graph (, )][DBLP]
    
    
18. 
    On the pebbling threshold of paths and the pebbling threshold spectrum. [Citation Graph (, )][DBLP]
    
    
19. 
    Economical tight examples for the biased Erdös-Selfridge theorem. [Citation Graph (, )][DBLP]
    
    
20. 
    Representation of group elements as subsequence sums. [Citation Graph (, )][DBLP]
    
    
21. 
    On decomposability of 4-ary distance 2 MDS codes, double-codes, and n-quasigroups of order 4. [Citation Graph (, )][DBLP]
    
    
22. 
    Modified group divisible designs with block size 5 and even index. [Citation Graph (, )][DBLP]
    
    
23. 
    Friendship decompositions of graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    Two new methods to obtain super vertex-magic total labelings of graphs. [Citation Graph (, )][DBLP]
    
    
25. 
    Remarks on the minus (signed) total domination in graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    Shortest single axioms for commutative moufang loops of exponent 3. [Citation Graph (, )][DBLP]
    
    
27. 
    Matrices with maximum kth local exponent in the class of doubly symmetric primitive matrices. [Citation Graph (, )][DBLP]
    
    
28. 
    Constructing all magic squares of order three. [Citation Graph (, )][DBLP]
    
    
29. 
    The diameter of protean graphs. [Citation Graph (, )][DBLP]
    
    
30. 
    Extremal trees with given degree sequence for the Randic index. [Citation Graph (, )][DBLP]
    
    
31. 
    Hoàng-Reed conjecture holds for tournaments. [Citation Graph (, )][DBLP]
    
    
32. 
    Upper signed domination number. [Citation Graph (, )][DBLP]
    
    
33. 
    A characterization of (2gamma, gamma_p)-trees. [Citation Graph (, )][DBLP]