Journals in DBLP

Discrete Mathematics
1984, volume: 51, number: 1

1. M. L. Gardner
   Hypergraphs and Whitney's theorem on edge-isomorphisms of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1984, v:51, n:1, pp:1-9 [Journal]
   
2. Charles M. Grinstead
   On circular critical graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1984, v:51, n:1, pp:11-24 [Journal]
   
3. Alon Itai, Avram Zehavi
   Bounds on path connectivity. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1984, v:51, n:1, pp:25-34 [Journal]
   
4. Robert E. Jamison, Richard J. Nowakowski
   A Helly theorem for convexity in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1984, v:51, n:1, pp:35-39 [Journal]
   
5. A. Kyriakoussis
   A central limit theorem for numbers satisfying a class of triangular arrays. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1984, v:51, n:1, pp:41-46 [Journal]
   
6. P. Marchioro, Aurora Morgana, Rossella Petreschi, Bruno Simeone
   Degree sequences of matrogenic graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1984, v:51, n:1, pp:47-61 [Journal]
   
7. James G. Oxley
   On minor-minimally-connected matroids. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1984, v:51, n:1, pp:63-72 [Journal]
   
8. C. A. Rodger
   Embedding an incomplete latin square in a latin square with a prescribed diagonal. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1984, v:51, n:1, pp:73-89 [Journal]
   
9. Regina Tyshkevich
   Once more on matrogenic graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1984, v:51, n:1, pp:91-100 [Journal]
   
10. Doron Zeilberger
    A short hook-lengths bijection inspired by the Greene-Nijenhuis-Wilf proof. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:101-108 [Journal]
    
11. Doron Zeilberger
    Garsia and Milne's bijective proof of the inclusion-exclusion principle. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:51, n:1, pp:109-110 [Journal]