Journals in DBLP

Discrete Mathematics
2008, volume: 308, number: 7

1. 
   Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid. [Citation Graph (, )][DBLP]
   
   
2. 
   On a cyclic connectivity property of directed graphs. [Citation Graph (, )][DBLP]
   
   
3. 
   Prefix-primitivity-preserving homomorphisms. [Citation Graph (, )][DBLP]
   
   
4. 
   An analysis of the (colored cudes)₃ puzzle. [Citation Graph (, )][DBLP]
   
   
5. 
   Exponentially many nonisomorphic orientable triangular embeddings of K_12s. [Citation Graph (, )][DBLP]
   
   
6. 
   A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs. [Citation Graph (, )][DBLP]
   
   
7. 
   Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   Near automorphisms of cycles. [Citation Graph (, )][DBLP]
   
   
9. 
   Classes of optical orthogonal codes from arcs in root subspaces. [Citation Graph (, )][DBLP]
   
   
10. 
    A few more Kirkman squares and doubly near resolvable BIBDs with block size 3. [Citation Graph (, )][DBLP]
    
    
11. 
    Adaptive group testing for consecutive positives. [Citation Graph (, )][DBLP]
    
    
12. 
    The game of 3-Euclid. [Citation Graph (, )][DBLP]
    
    
13. 
    On deletions of largest bonds in graphs. [Citation Graph (, )][DBLP]
    
    
14. 
    Graphical complexity of products of permutation groups. [Citation Graph (, )][DBLP]
    
    
15. 
    Radio number for trees. [Citation Graph (, )][DBLP]
    
    
16. 
    On domination and reinforcement numbers in trees. [Citation Graph (, )][DBLP]
    
    
17. 
    Crossing graphs of fiber-complemented graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Joining caterpillars and stability of the tree center. [Citation Graph (, )][DBLP]
    
    
19. 
    Newman's phenomenon for generalized Thue-Morse sequences. [Citation Graph (, )][DBLP]
    
    
20. 
    2-Binary trees: Bijections and related issues. [Citation Graph (, )][DBLP]
    
    
21. 
    Relative length of longest paths and longest cycles in triangle-free graphs. [Citation Graph (, )][DBLP]
    
    
22. 
    The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two. [Citation Graph (, )][DBLP]
    
    
23. 
    Matching properties in connected domination critical graphs. [Citation Graph (, )][DBLP]
    
    
24. 
    On arbitrarily vertex decomposable trees. [Citation Graph (, )][DBLP]
    
    
25. 
    Bandwidth of the strong product of two connected graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5. [Citation Graph (, )][DBLP]
    
    
27. 
    Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope. [Citation Graph (, )][DBLP]
    
    
28. 
    Minimal non-1-planar graphs. [Citation Graph (, )][DBLP]
    
    
29. 
    The Chung-Feller theorem revisited. [Citation Graph (, )][DBLP]
    
    
30. 
    On spanning connected graphs. [Citation Graph (, )][DBLP]
    
    
31. 
    NP-completeness of 4-incidence colorability of semi-cubic graphs. [Citation Graph (, )][DBLP]
    
    
32. 
    A geometric construction of a (38, 2)-blocking set in PG(2, 13) and the related [145, 3, 133]₁₃ code. [Citation Graph (, )][DBLP]