Journals in DBLP

Discrete Mathematics
1987, volume: 65, number: 3

1. Stefan A. Burr
   On the Ramsey numbers r(G, nH) and r(nG, nH) when n is large. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:65, n:3, pp:215-229 [Journal]
   
2. Pierre Duchet, Yahya Ould Hamidoune, Henry Meyniel
   Sur les quasi-noyaux d'un graphe. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:65, n:3, pp:231-235 [Journal]
   
3. Philippe Godlewski
   Wom-codes construits à partir des codes de hamming. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:65, n:3, pp:237-243 [Journal]
   
4. Mark D. Halsey
   Line-closed combinatorial geometries. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:65, n:3, pp:245-248 [Journal]
   
5. Meir Katchalski, Ted Lewis, A. Liu
   Geometric permutations of disjoint translates of convex sets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:65, n:3, pp:249-259 [Journal]
   
6. Alexander Rosa
   Repeated blocks in indecomposable twofold triple systems. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:65, n:3, pp:261-276 [Journal]
   
7. J. M. S. Simões-Pereira
   A note on distance matrices with unicyclic graph realizations. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:65, n:3, pp:277-287 [Journal]
   
8. Douglas R. Stinson
   Frames for Kirkman triple systems. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:65, n:3, pp:289-300 [Journal]
   
9. Luc Teirlinck
   Non-trivial t-designs without repeated blocks exist for all t. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1987, v:65, n:3, pp:301-311 [Journal]
   
10. E. J. F. Primrose
    A correspondence between two Catalan sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:3, pp:313-315 [Journal]
    
11. Bruce A. Reed
    A note on even pairs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:3, pp:317-318 [Journal]
    
12. Adolfo Sánchez-Flores
    A counterexample to a generalization of Richardson's theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:65, n:3, pp:319-320 [Journal]