Journals in DBLP

Discrete Mathematics
2003, volume: 270, number: 1-3

1. 
   To the Readers and... . [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:1-0 [Journal]
   
2. Terry A. McKee
   Subgraph trees in graph theory. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:3-12 [Journal]
   
3. Martin Bokler
   Lower bounds for the cardinality of minimal blocking sets in projective spaces. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:13-31 [Journal]
   
4. Anthony Bonato
   Homomorphisms and amalgamation. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:32-41 [Journal]
   
5. Alexis Bonnecaze, YoungJu Choie, Steven T. Dougherty, Patrick Solé
   Splitting the shadow. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:42-59 [Journal]
   
6. Marc Chastand, Norbert Polat
   Reconstruction of infinite locally finite connected graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:60-97 [Journal]
   
7. Dameng Deng, Rolf S. Rees, Hao Shen
   Further results on nearly Kirkman triple systems with subsystems. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:98-113 [Journal]
   
8. Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang
   Covering vertices of a graph by k disjoint cycles. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:114-124 [Journal]
   
9. Katalin Friedl, Lajos Rónyai
   Order shattering and Wilson's theorem. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:270, n:1-3, pp:126-135 [Journal]
   
10. Aicke Hinrichs, Christian Richter
    New sets with large Borsuk numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:136-146 [Journal]
    
11. Xiang-dong Hou
    Rings and constructions of partial difference sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:148-175 [Journal]
    
12. Franz Lehner
    Cumulants, lattice paths, and orthogonal polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:176-190 [Journal]
    
13. Manoel Lemos
    Matroids with many common bases. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:192-204 [Journal]
    
14. Vito Napolitano
    On a class of finite linear spaces with few lines. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:206-223 [Journal]
    
15. Vito Napolitano
    Erratum to "On a class of finite linear spaces with few lines": [Discrete Mathematics 270 (2003) 207-224]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:224-225 [Journal]
    
16. Oliver Pretzel
    On reorienting graphs by pushing down maximal vertices--II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:226-239 [Journal]
    
17. Dieter Rautenbach, Lutz Volkmann
    On alpha_rgamma_s(k)-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:240-249 [Journal]
    
18. Lingsheng Shi
    Upper bounds for Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:250-264 [Journal]
    
19. Bertran Steinsky
    Enumeration of labelled chain graphs and labelled essential directed acyclic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:266-277 [Journal]
    
20. Paul Thomas Young
    Congruences for degenerate number sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:278-288 [Journal]
    
21. M. H. Armanious
    Semi-planar Steiner loops of cardinality 2n. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:290-297 [Journal]
    
22. Toru Kojima
    Bandwidth of the composition of two graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:298-308 [Journal]
    
23. Jixiang Meng, Zhao Zhang
    Number of minimum vertex cuts in transitive graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:310-316 [Journal]
    
24. Jian-Hua Yin, Jiong-Sheng Li, Guo-Liang Chen
    The smallest degree sum that yields potentially _kC_l-graphic sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:318-326 [Journal]
    
25. Michael Böttcher, Ulrich Knauer
    Postscript: "Endomorphism spectra of graphs" [Discrete Mathematics 109 (1992) 45-57]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:328-330 [Journal]
    
26. Darla Kremer
    Postscript: "Permutations with forbidden subsequences and a generalized Schro"der number" [Discrete Mathematics 218 (2000) 121-130]. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:270, n:1-3, pp:332-333 [Journal]