Journals in DBLP

Discrete Mathematics
1991, volume: 87, number: 2

1. Denise Amar, André Raspaud
   Covering the vertices of a digraph by cycles of prescribed length. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:87, n:2, pp:111-118 [Journal]
   
2. Béla Bollobás, H. R. Hind
   Graphs without large triangle free subgraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:87, n:2, pp:119-131 [Journal]
   
3. Jacques Désarménien, Dominique Foata
   Statistiques d'ordre sur les permutations colorées. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:87, n:2, pp:133-148 [Journal]
   
4. Tom Greene
   Descriptively sufficient subcollections of flats in matroids. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:87, n:2, pp:149-161 [Journal]
   
5. Wei-Ping Liu, Ivan Rival
   Inversions, cuts, and orientations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:87, n:2, pp:163-174 [Journal]
   
6. Martin Skoviera
   The maximum genus of graphs of diameter two. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:87, n:2, pp:175-180 [Journal]
   
7. Guo-Zhen Xiao, Ba-Zhong Shen, Chuan-Kun Wu, Chi Song Wong
   Some spectral techniques in coding theory. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:87, n:2, pp:181-186 [Journal]
   
8. Mieko Yamada
   Hadamard matrices of generalized quaternion type. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:87, n:2, pp:187-196 [Journal]
   
9. Yongjin Zhu, Feng Tian, Xiaotie Deng
   More powerful closure operations on graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1991, v:87, n:2, pp:197-214 [Journal]
   
10. Olof Heden
    No partial 1-spread of class [0, >=2]_d in PG(2d-1, q) exists. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:2, pp:215-216 [Journal]
    
11. Liang Sun
    On a problem of J. Csima. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:2, pp:217-218 [Journal]