Journals in DBLP

Discrete Mathematics
1981, volume: 37, number: 2-3

1. H. L. Abbott, A. C. Liu
   On property B(s), II. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:37, n:2-3, pp:135-141 [Journal]
   
2. Jaromir Abrham, Anton Kotzig
   Skolem sequences and additive permutations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:37, n:2-3, pp:143-146 [Journal]
   
3. Eiichi Bannai, Tatsuro Ito
   Regular graphs with excess one. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:37, n:2-3, pp:147-158 [Journal]
   
4. Bhagwandas, W. G. Bridges
   Applications of algebraic duality to group divisible structures. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:37, n:2-3, pp:159-166 [Journal]
   
5. Wayne M. Dymàcek
   Complements of Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:37, n:2-3, pp:167-180 [Journal]
   
6. Wen-Lian Hsu, George L. Nemhauser
   Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:37, n:2-3, pp:181-191 [Journal]
   
7. S. A. Joni, G.-C. Rota, Bruce E. Sagan
   From sets to functions: Three elementary examples. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:37, n:2-3, pp:193-202 [Journal]
   
8. A. Donald Keedwell
   On the sequenceability of non-abelian groups of order pq. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:37, n:2-3, pp:203-216 [Journal]
   
9. János Pach
   Graphs whose every independent set has a common neighbour. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1981, v:37, n:2-3, pp:217-228 [Journal]
   
10. L. J. Senechal
    Chain algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:229-244 [Journal]
    
11. H. M. Shefrin
    On the combinatorial structure of Bayesian learning with imperfect information. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:245-254 [Journal]
    
12. Richard P. Stanley
    Factorization of permutations into n-cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:255-262 [Journal]
    
13. Ioan Tomescu
    Le nombre maximum de cliques et de recouvrements par cliques des hypergraphes chromatiques complets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:263-277 [Journal]
    
14. Hian Poh Yap
    On graphs whose maximal subgraphs have at most two orbits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:279-287 [Journal]
    
15. Hian Poh Yap
    On graphs critical with respect to edge-colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:289-296 [Journal]
    
16. Maciej M. Syslo
    The Helly-type property of non-trivial intervals on a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:297-298 [Journal]
    
17. Jean-Paul Doignon
    On characterizations of binary and graphic matroids. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1981, v:37, n:2-3, pp:299-301 [Journal]