Journals in DBLP

Discrete Mathematics
1987, volume: 64, number: 2-3

1. Arkady A. Chernyak, Zhanna A. Chernyak, R. I. Tyshkevich
   On forcibly hereditary p-graphical sequences. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:64, n:2-3, pp:111-113 [Journal]
   
2. Mary H. Dauenhauer, Hans Zassenhaus
   Local optimality of the critical lattice sphere-packing of regular tetrahedra. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:64, n:2-3, pp:129-146 [Journal]
   
3. Anthony B. Evans
   Orthomorphisms of Z_p. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:64, n:2-3, pp:147-156 [Journal]
   
4. Daniel Hershkowitz
   Linear mappings which preserve acyclicity properties of graphs and digraphs and applications to matrices. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:64, n:2-3, pp:157-190 [Journal]
   
5. Tayuan Huang
   An analogue of the Erdös-Ko-Rado theorem for the distance-regular graphs of bilinear forms. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:64, n:2-3, pp:191-198 [Journal]
   
6. Nirmala B. Limaye, Sharad S. Sane, Mohan S. Shrikhande
   The structure of triangle-free quasi-symmetric designs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:64, n:2-3, pp:199-207 [Journal]
   
7. Fabrizio Luccio, S. Mazzone, C. K. Wong
   A note on visibility graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:64, n:2-3, pp:209-219 [Journal]
   
8. Melvyn B. Nathanson
   An extremal problem for least common multiples. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:64, n:2-3, pp:221-228 [Journal]
   
9. Norbert Polat
   A compactness result for perfect matchings. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:64, n:2-3, pp:229-237 [Journal]
   
10. Alejandro A. Schäffer
    Shortest prefix strings containing all subset permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:239-252 [Journal]
    
11. Boris M. Schein
    Semigroups of tolerance relations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:253-262 [Journal]
    
12. Jozef Sirán, Peter Horák
    A construction of thickness-minimal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:263-268 [Journal]
    
13. Howard Straubing
    Applications of the theory of automata in enumeration. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:269-279 [Journal]
    
14. T. Watanabe, S. G. Monanty
    On an inclusion-exclusion formula based on the reflection principle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:281-288 [Journal]
    
15. Fuji Zhang, Xiaofeng Guo
    Hamilton cycles in directed Euler tour graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:289-298 [Journal]
    
16. M. L. N. Downs, G. A. Jones
    Enumerating regular objects with a given automorphism group. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:299-302 [Journal]
    
17. Anthony J. W. Hilton
    Recent progress on edge-colouring graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:303-307 [Journal]
    
18. Hiroshi Maehara
    On the number of induced subgraphs of a random graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:309-312 [Journal]
    
19. Doron Zeilberger
    Enumerating totally clean words. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:64, n:2-3, pp:313-315 [Journal]