Journals in DBLP

Discrete Mathematics
2010, volume: 310, number: 4

1. 
   Vertex-transitive self-complementary uniform hypergraphs of prime order. [Citation Graph (, )][DBLP]
   
   
2. 
   A note on an embedding problem in transitive tournaments. [Citation Graph (, )][DBLP]
   
   
3. 
   Graphs with the maximum or minimum number of 1-factors. [Citation Graph (, )][DBLP]
   
   
4. 
   Quarter-regular biembeddings of Latin squares. [Citation Graph (, )][DBLP]
   
   
5. 
   Decomposing triples into cyclic designs. [Citation Graph (, )][DBLP]
   
   
6. 
   Posets associated with subspaces in a d-bounded distance-regular graph. [Citation Graph (, )][DBLP]
   
   
7. 
   Cross L-intersecting families on set systems. [Citation Graph (, )][DBLP]
   
   
8. 
   Minimal Euclidean representations of graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   The square of a block graph. [Citation Graph (, )][DBLP]
   
   
10. 
    Large induced subgraphs with equated maximum degree. [Citation Graph (, )][DBLP]
    
    
11. 
    Bipancyclic properties of Cayley graphs generated by transpositions. [Citation Graph (, )][DBLP]
    
    
12. 
    The valuations of the near octagon G₄. [Citation Graph (, )][DBLP]
    
    
13. 
    Some new results on walk regular graphs which are cospectral to its complement. [Citation Graph (, )][DBLP]
    
    
14. 
    Rainbow paths. [Citation Graph (, )][DBLP]
    
    
15. 
    Scattering matrices of regular coverings of graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    The asymptotic number of spanning trees in circulant graphs. [Citation Graph (, )][DBLP]
    
    
17. 
    On Cayley graphs of rectangular groups. [Citation Graph (, )][DBLP]
    
    
18. 
    Integral complete multipartite graphs K_{a1.p1, a2.p2, ..., as.ps} with s=5, 6. [Citation Graph (, )][DBLP]
    
    
19. 
    A characterization of signed graphs with generalized perfect elimination orderings. [Citation Graph (, )][DBLP]
    
    
20. 
    Some remarks on the geodetic number of a graph. [Citation Graph (, )][DBLP]
    
    
21. 
    Every tree is a large subtree of a tree that decomposes K_n or K_{n, n}. [Citation Graph (, )][DBLP]
    
    
22. 
    A short constructive proof of the Erdos-Gallai characterization of graphic lists. [Citation Graph (, )][DBLP]
    
    
23. 
    Diamond-free circle graphs are Helly circle. [Citation Graph (, )][DBLP]
    
    
24. 
    Cycle factors in strongly connected local tournaments. [Citation Graph (, )][DBLP]
    
    
25. 
    On inequalities and linear relations for 7-core partitions. [Citation Graph (, )][DBLP]
    
    
26. 
    Hall-Littlewood polynomials and fixed point enumeration. [Citation Graph (, )][DBLP]
    
    
27. 
    A new class of transitive graphs. [Citation Graph (, )][DBLP]
    
    
28. 
    On the existence of maximum resolvable (K₄-e)-packings. [Citation Graph (, )][DBLP]
    
    
29. 
    Rooted directed path graphs are leaf powers. [Citation Graph (, )][DBLP]
    
    
30. 
    Algebraic connectivity for vertex-deleted subgraphs, and a notion of vertex centrality. [Citation Graph (, )][DBLP]
    
    
31. 
    Simply sequentially additive labelings of 2-regular graphs. [Citation Graph (, )][DBLP]
    
    
32. 
    On (s, t)-supereulerian graphs in locally highly connected graphs. [Citation Graph (, )][DBLP]
    
    
33. 
    A new upper bound on the queuenumber of hypercubes. [Citation Graph (, )][DBLP]
    
    
34. 
    On diameter and inverse degree of a graph. [Citation Graph (, )][DBLP]
    
    
35. 
    Minimizing the least eigenvalue of unicyclic graphs with fixed diameter. [Citation Graph (, )][DBLP]
    
    
36. 
    Monochromatic simplices of any volume. [Citation Graph (, )][DBLP]
    
    
37. 
    A note on the rank parity function. [Citation Graph (, )][DBLP]
    
    
38. 
    A note on certain de Bruijn sequences with forbidden subsequences. [Citation Graph (, )][DBLP]
    
    
39. 
    New explicit bounds for ordered codes and (t, m, s)-nets. [Citation Graph (, )][DBLP]