Journals in DBLP

Discrete Mathematics
2008, volume: 308, number: 10

1. 
   Remarks on convex functions and separable sequences. [Citation Graph (, )][DBLP]
   
   
2. 
   Forbidden retracts for finite ordered sets of width at most four. [Citation Graph (, )][DBLP]
   
   
3. 
   Extremal perfect graphs for a bound on the domination number. [Citation Graph (, )][DBLP]
   
   
4. 
   On complexity of special maximum matchings constructing. [Citation Graph (, )][DBLP]
   
   
5. 
   On tree congestion of graphs. [Citation Graph (, )][DBLP]
   
   
6. 
   A family of regular graphs of girth 5. [Citation Graph (, )][DBLP]
   
   
7. 
   The signed-graphic representations of wheels and whirls. [Citation Graph (, )][DBLP]
   
   
8. 
   A note on chain lengths and the Tutte polynomial. [Citation Graph (, )][DBLP]
   
   
9. 
   The chromatic equivalence classes of the complements of graphs with the minimum real roots of their adjoint polynomials greater than -4. [Citation Graph (, )][DBLP]
   
   
10. 
    Lower bounds on several versions of signed domination number. [Citation Graph (, )][DBLP]
    
    
11. 
    On embeddings of snarks in the torus. [Citation Graph (, )][DBLP]
    
    
12. 
    The spectrum for large sets of pure Mendelsohn triple systems. [Citation Graph (, )][DBLP]
    
    
13. 
    Combinatorial functional and differential equations applied to differential posets. [Citation Graph (, )][DBLP]
    
    
14. 
    Further results on the enumeration of hamilton paths in Cayley digraphs on semidirect products of cyclic groups. [Citation Graph (, )][DBLP]
    
    
15. 
    Total restrained domination in graphs with minimum degree two. [Citation Graph (, )][DBLP]
    
    
16. 
    Lattices generated by join of strongly closed subgraphs in d-bounded distance-regular graphs. [Citation Graph (, )][DBLP]
    
    
17. 
    Domination numbers and zeros of chromatic polynomials. [Citation Graph (, )][DBLP]
    
    
18. 
    Self-orthogonal designs and codes from the symplectic groups S₄(3) and S₄(4). [Citation Graph (, )][DBLP]
    
    
19. 
    Extremal problems on detectable colorings of trees. [Citation Graph (, )][DBLP]
    
    
20. 
    On 2-factors with k components. [Citation Graph (, )][DBLP]
    
    
21. 
    Planar unit-distance graphs having planar unit-distance complement. [Citation Graph (, )][DBLP]
    
    
22. 
    Connectivity measures in matched sum graphs. [Citation Graph (, )][DBLP]
    
    
23. 
    Connectivity in frame matroids. [Citation Graph (, )][DBLP]
    
    
24. 
    The reconstruction conjecture and edge ideals. [Citation Graph (, )][DBLP]
    
    
25. 
    Clique partitions of complements of forests and bounded degree graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    New constructions of two slim dense near hexagons. [Citation Graph (, )][DBLP]
    
    
27. 
    On the total domination number of cross products of graphs. [Citation Graph (, )][DBLP]
    
    
28. 
    Addition theorems on the cyclic groups of order p^l. [Citation Graph (, )][DBLP]
    
    
29. 
    On the anomalous behaviour of a class of locality statistics. [Citation Graph (, )][DBLP]
    
    
30. 
    On the sum of distances along a circle. [Citation Graph (, )][DBLP]
    
    
31. 
    The Ramsey numbers for disjoint unions of graphs. [Citation Graph (, )][DBLP]
    
    
32. 
    Counting nowhere-zero flows on wheels. [Citation Graph (, )][DBLP]
    
    
33. 
    A note on atomistic weak congruence lattices. [Citation Graph (, )][DBLP]