Journals in DBLP

Discrete Mathematics
1990, volume: 80, number: 2

1. M. D. Atkinson, Alberto Negro, Nicola Santoro
   Sums of lexicographically ordered sets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:80, n:2, pp:115-122 [Journal]
   
2. Jason I. Brown, David Kelly, J. Schönheim, Robert E. Woodrow
   Graph coloring satisfying restraints. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:80, n:2, pp:123-143 [Journal]
   
3. Peter Flach, Lutz Volkmann
   Estimations for the domination number of a graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:80, n:2, pp:145-151 [Journal]
   
4. Neil Hindman
   On creating sets with large lower density. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:80, n:2, pp:153-157 [Journal]
   
5. Mikio Kano
   Sufficient conditions for a graph to have factors. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:80, n:2, pp:159-165 [Journal]
   
6. Dragan Marusic
   Hamiltonicity of tree-like graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:80, n:2, pp:167-173 [Journal]
   
7. S. Stueckle
   Chromatic automorphisms and symmetries of some graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:80, n:2, pp:175-181 [Journal]
   
8. Dennis E. White
   Hybrid tableaux and the Littlewood- Richardson rule. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:80, n:2, pp:183-206 [Journal]
   
9. Doron Zeilberger
   A fast algorithm for proving terminating hypergeometric identities. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1990, v:80, n:2, pp:207-211 [Journal]
   
10. Yanling Yang
    On a conjecture about monochromatic flats. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:2, pp:213-216 [Journal]
    
11. H. P. Yap
    Corrigendum to: on graphs critical with respect to edge-colourings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:80, n:2, pp:223- [Journal]