Journals in DBLP

Discrete Mathematics
2009, volume: 309, number: 4

1. 
   On Whitney numbers of the order ideals of generalized fences and crowns. [Citation Graph (, )][DBLP]
   
   
2. 
   Domination subdivision numbers of trees. [Citation Graph (, )][DBLP]
   
   
3. 
   On 3-restricted edge connectivity of undirected binary Kautz graphs. [Citation Graph (, )][DBLP]
   
   
4. 
   An upper bound on the domination number of a graph with minimum degree 2. [Citation Graph (, )][DBLP]
   
   
5. 
   Weak cycle partition involving degree sum conditions. [Citation Graph (, )][DBLP]
   
   
6. 
   Removing circuits in 3-connected binary matroids. [Citation Graph (, )][DBLP]
   
   
7. 
   3-trees with few vertices of degree 3 in circuit graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   Equivalence of operations with respect to discriminator clones. [Citation Graph (, )][DBLP]
   
   
9. 
   On semi-planar Steiner quasigroups. [Citation Graph (, )][DBLP]
   
   
10. 
    Characterization of a class of graphs related to pairs of disjoint matchings. [Citation Graph (, )][DBLP]
    
    
11. 
    The uniqueness of a generalized hexagon of order 3 containing a subhexagon of order (1, 3). [Citation Graph (, )][DBLP]
    
    
12. 
    k-ribbon Fibonacci tableaux. [Citation Graph (, )][DBLP]
    
    
13. 
    Tactical (de-)compositions of symmetric configurations. [Citation Graph (, )][DBLP]
    
    
14. 
    Local bases of primitive non-powerful signed digraphs. [Citation Graph (, )][DBLP]
    
    
15. 
    On bipartite zero-divisor graphs. [Citation Graph (, )][DBLP]
    
    
16. 
    Symmetry groups of Rosenbloom-Tsfasman spaces. [Citation Graph (, )][DBLP]
    
    
17. 
    Separation of clones of cooperations by cohyperidentities. [Citation Graph (, )][DBLP]
    
    
18. 
    Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph. [Citation Graph (, )][DBLP]
    
    
19. 
    On smooth sets of integers. [Citation Graph (, )][DBLP]
    
    
20. 
    Weighted lattice polynomials. [Citation Graph (, )][DBLP]
    
    
21. 
    The spectrum for quasigroups with cyclic automorphisms and additional symmetries. [Citation Graph (, )][DBLP]
    
    
22. 
    Bounds on isoperimetric values of trees. [Citation Graph (, )][DBLP]
    
    
23. 
    On the OBDD size for graphs of bounded tree- and clique-width. [Citation Graph (, )][DBLP]
    
    
24. 
    Exponentially many nonisomorphic orientable triangular embeddings of K_12s+3. [Citation Graph (, )][DBLP]
    
    
25. 
    On the fractional chromatic number of monotone self-dual Boolean functions. [Citation Graph (, )][DBLP]
    
    
26. 
    Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence. [Citation Graph (, )][DBLP]
    
    
27. 
    Shortened recurrence relations for Bernoulli numbers. [Citation Graph (, )][DBLP]
    
    
28. 
    Semi-hyper-connected vertex transitive graphs. [Citation Graph (, )][DBLP]
    
    
29. 
    Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2. [Citation Graph (, )][DBLP]
    
    
30. 
    Maximal planar graphs of inscribable type and diagonal flips. [Citation Graph (, )][DBLP]
    
    
31. 
    On Tutte polynomial uniqueness of twisted wheels. [Citation Graph (, )][DBLP]
    
    
32. 
    Tromino tilings of domino-deficient rectangles. [Citation Graph (, )][DBLP]
    
    
33. 
    The existence of HGDDs with block size four and its application to double frames. [Citation Graph (, )][DBLP]
    
    
34. 
    The existence of regular self-complementary 3-uniform hypergraphs. [Citation Graph (, )][DBLP]
    
    
35. 
    Measure preserving homomorphisms and independent sets in tensor graph powers. [Citation Graph (, )][DBLP]
    
    
36. 
    A simple bijection between a subclass of 2-binary trees and ternary trees. [Citation Graph (, )][DBLP]
    
    
37. 
    On the subgroup distance problem. [Citation Graph (, )][DBLP]
    
    
38. 
    The N-queens Problem on a symmetric Toeplitz matrix. [Citation Graph (, )][DBLP]
    
    
39. 
    A tripling construction for overlarge sets of KTS. [Citation Graph (, )][DBLP]
    
    
40. 
    The total chromatic number of Pseudo-Halin graphs with lower degree. [Citation Graph (, )][DBLP]
    
    
41. 
    A generalization of Fan's results: Distribution of cycle lengths in graphs. [Citation Graph (, )][DBLP]
    
    
42. 
    A constructive characterization of total domination vertex critical graphs. [Citation Graph (, )][DBLP]
    
    
43. 
    Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. [Citation Graph (, )][DBLP]
    
    
44. 
    Diameter vulnerability of graphs by edge deletion. [Citation Graph (, )][DBLP]
    
    
45. 
    On signed cycle domination in graphs. [Citation Graph (, )][DBLP]
    
    
46. 
    Every cycle-connected multipartite tournament has a universal arc. [Citation Graph (, )][DBLP]