Journals in DBLP

Discrete Mathematics
2008, volume: 308, number: 11

1. 
   The volume and foundation of star trades. [Citation Graph (, )][DBLP]
   
   
2. 
   The vertex isoperimetric problem for the powers of the diamond graph. [Citation Graph (, )][DBLP]
   
   
3. 
   Clique coverings and partitions of line graphs. [Citation Graph (, )][DBLP]
   
   
4. 
   Point-weight designs with design conditions on t points. [Citation Graph (, )][DBLP]
   
   
5. 
   Characterization of graphs with infinite cyclic edge connectivity. [Citation Graph (, )][DBLP]
   
   
6. 
   Retractions onto series-parallel posets. [Citation Graph (, )][DBLP]
   
   
7. 
   All 2-connected in-tournaments that are cycle complementary. [Citation Graph (, )][DBLP]
   
   
8. 
   Chromatic capacity and graph operations. [Citation Graph (, )][DBLP]
   
   
9. 
   On 3-regular 4-ordered graphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Classification of reflexible regular embeddings and self-Petrie dual regular embeddings of complete bipartite graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Characterizations of postman sets. [Citation Graph (, )][DBLP]
    
    
12. 
    On the sphericity testing of single source digraphs. [Citation Graph (, )][DBLP]
    
    
13. 
    Logarithmic behavior of some combinatorial sequences. [Citation Graph (, )][DBLP]
    
    
14. 
    Searching monotone multi-dimensional arrays. [Citation Graph (, )][DBLP]
    
    
15. 
    Riordan paths and derangements. [Citation Graph (, )][DBLP]
    
    
16. 
    Optimal graphs for chromatic polynomials. [Citation Graph (, )][DBLP]
    
    
17. 
    Distinguishing colorings of Cartesian products of complete graphs. [Citation Graph (, )][DBLP]
    
    
18. 
    Weighted cross-intersecting families. [Citation Graph (, )][DBLP]
    
    
19. 
    Unbordered factors and Lyndon words. [Citation Graph (, )][DBLP]
    
    
20. 
    A sufficient condition for the bicolorability of a hypergraph. [Citation Graph (, )][DBLP]
    
    
21. 
    Characterizing minimally n-extendable bipartite graphs. [Citation Graph (, )][DBLP]
    
    
22. 
    The transitivity of Conway's M₁₃. [Citation Graph (, )][DBLP]
    
    
23. 
    On graphs with equal domination and 2-domination numbers. [Citation Graph (, )][DBLP]
    
    
24. 
    Connected even factors in claw-free graphs. [Citation Graph (, )][DBLP]
    
    
25. 
    A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    On semigroup presentations and Adian graphs. [Citation Graph (, )][DBLP]
    
    
27. 
    Note on the degree sequences of k-hypertournaments. [Citation Graph (, )][DBLP]
    
    
28. 
    Counting perfect matchings in n-extendable graphs. [Citation Graph (, )][DBLP]
    
    
29. 
    Improved pebbling bounds. [Citation Graph (, )][DBLP]
    
    
30. 
    Decompositions of two-dimensional simplicial complexes. [Citation Graph (, )][DBLP]
    
    
31. 
    On matching and total domination in graphs. [Citation Graph (, )][DBLP]
    
    
32. 
    Small deviations, JIT sequencing and symmetric case of Fraenkel's conjecture. [Citation Graph (, )][DBLP]
    
    
33. 
    A note on domination, girth and minimum degree. [Citation Graph (, )][DBLP]
    
    
34. 
    The distinguishing number of the augmented cube and hypercube powers. [Citation Graph (, )][DBLP]
    
    
35. 
    Structural properties of graphs of diameter 2 with maximal repeats. [Citation Graph (, )][DBLP]