Journals in DBLP

Discrete Mathematics
1981, volume: 34, number: 1

1. Robert C. Brigham, Ronald D. Dutton
   Graphs which, with their complements, have certain clique covering numbers. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:34, n:1, pp:1-7 [Journal]
   
2. William H. Burge
   A correspondence between partitions related to generalizations of the Rogers-Ramanujan identities. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:34, n:1, pp:9-15 [Journal]
   
3. Lowell A. Carmony, Soon Teck Tan
   S-Quasi-symmetry. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:34, n:1, pp:17-24 [Journal]
   
4. S. Gallivan, E. R. Lockeberg, P. Mcmullen
   Complete subgraphs of the graphs of convex polytopes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:34, n:1, pp:25-29 [Journal]
   
5. Mario Gionfriddo, C. C. Lindler
   Construction of steiner quadruple systems having a prescribed number of blocks in common. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:34, n:1, pp:31-42 [Journal]
   
6. Martin Grötschel, Yoshiko Wakabayashi
   On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:34, n:1, pp:43-59 [Journal]
   
7. Cornelis Hoede, Henk Jan Veldman
   Contraction theorems in Hamiltonian graph theory. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:34, n:1, pp:61-67 [Journal]
   
8. Paul M. B. Vitányi
   How well can a graph be n-colored? [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:34, n:1, pp:69-80 [Journal]
   
9. Charalambos A. Charalambides
   Bipartitional polynomials and their applications in combinatorics and statistics. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:34, n:1, pp:81-84 [Journal]
   
10. B. L. Misra, M. L. Chandak
    Construction of symmetric PBIB designs and related results. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:1, pp:85-87 [Journal]
    
11. Doron Zeilberger
    Enumeration of words by their number of mistakes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:1, pp:89-91 [Journal]
    
12. Mitsuo Yoshizawa
    Remarks on distance-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:1, pp:93-94 [Journal]
    
13. L. Zhu
    Affinely totally variant subsets of V₃(GF(3)). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:34, n:1, pp:95-99 [Journal]