Journals in DBLP

Discrete Mathematics
1987, volume: 66, number: 1-2

1. M. E. Adams, Hilary A. Priestley
   De Morgan algebras are universal. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:66, n:1-2, pp:1-13 [Journal]
   
2. Kiyoshi Ando, Yoko Usami
   Critically (k, k)-connected graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:66, n:1-2, pp:15-20 [Journal]
   
3. Abdelhamid Benhocine, Jean-Luc Fouquet
   The Chvátal-Erdös condition and pancyclic line-graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:66, n:1-2, pp:21-26 [Journal]
   
4. Endre Boros
   On a linear diophantine problem for geometrical type sequences. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:66, n:1-2, pp:27-33 [Journal]
   
5. Richard P. Brent, Brendan D. McKay
   Determinants and ranks of random matrices over Z_m. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:66, n:1-2, pp:35-49 [Journal]
   
6. Yunshyong Chow
   On the number of regular configurations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:66, n:1-2, pp:51-58 [Journal]
   
7. Kevin J. Compton
   Some methods for computing component distribution probabilities in relational structures. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:66, n:1-2, pp:59-77 [Journal]
   
8. William E. Fenton
   Completeness in oriented matroids. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:66, n:1-2, pp:79-89 [Journal]
   
9. Ronald J. Gould, Robert Roth
   Cayley digraphs and (1, j, n)-sequencings of the alternating groups A_n. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:66, n:1-2, pp:91-102 [Journal]
   
10. Chính T. Hoàng, Bruce A. Reed
    A note on short cycles in diagraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:103-107 [Journal]
    
11. F. K. Hwang, Y. H. Xu
    Double loop networks with minimum delay. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:109-118 [Journal]
    
12. Adam Idzik, Jan Komar, Marcin Malawski
    Edge-coloured complete graphs: Connectedness of some subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:119-125 [Journal]
    
13. Bill Jackson
    Compatible Euler tours for transition systems in Eulerian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:127-131 [Journal]
    
14. Sandi Klavzar, Marko Petkovsek
    Intersection graphs of halflines and halfplanes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:133-137 [Journal]
    
15. Inessa Levi
    Order-automorphisms of normal subsets of a power set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:139-155 [Journal]
    
16. Zbigniew Lonc
    Decompositions of hypergraphs into hyperstars. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:157-168 [Journal]
    
17. Dragan Marusic
    Hamiltonian cycles in vertex symmetric graphs of order 2P². [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:169-174 [Journal]
    
18. M. L. Narayana Rao, K. Satyanarayana, G. Vithal Rao
    On a class of translation planes of square order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:175-190 [Journal]
    
19. Jonathan D. H. Smith
    Minimal trees of given search number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:191-202 [Journal]
    
20. André Bouchet
    Unimodularity and circle graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:203-208 [Journal]
    
21. Douglas R. Woodall
    An impossibility theorem for electoral systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:209-211 [Journal]