Journals in DBLP

Discrete Applied Mathematics
2002, volume: 116, number: 1-2

1. R. Julian R. Abel, Frank E. Bennett, Gennian Ge
   Almost resolvable perfect Mendelsohn designs with block size five. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:1-15 [Journal]
   
2. József Balogh, Béla Bollobás, David Weinreich
   Measures on monotone properties of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:17-36 [Journal]
   
3. Dominique Barth, Paraskevi Fragopoulou, Marie-Claude Heydemann
   Uniform emulations of Cartesian-product and Cayley graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:37-54 [Journal]
   
4. Gunnar Brinkmann, U. v. Nathusius, A. H. R. Palser
   A constructive enumeration of nanotube cap. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:55-71 [Journal]
   
5. Rostislav Caha, Václav Koubek
   Optimal embeddings of odd ladders into a hypercube. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:73-102 [Journal]
   
6. Maw-Shang Chang, Shaur-Ching Wu, Gerard J. Chang, Hong-Gwa Yeh
   Domination in distance-hereditary graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:103-113 [Journal]
   
7. Gary Chartrand, John Frederick Fink, Ping Zhang
   Convexity in oriented graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:115-126 [Journal]
   
8. Elias Dahlhaus
   Minimal elimination ordering for graphs of bounded degree. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:127-143 [Journal]
   
9. Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
   Augmenting trees so that every three vertices lie on a cycle. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:145-159 [Journal]
   
10. C. E. Ferreira, C. Carvalho de Souza, Yoshiko Wakabayashi
    Rearrangement of DNA fragments: a branch-and-cut algorithm. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2002, v:116, n:1-2, pp:161-177 [Journal]