Journals in DBLP

Networks
2001, volume: 37, number: 3

1. Falk Nicolai, Thomas Szymczak
   Homogeneous sets and domination: A linear time algorithm for distance - hereditary graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:3, pp:117-128 [Journal]
   
2. Zbigniew Lonc, Krzysztof Parol, Jacek Wojciechowski
   On the number of spanning trees in directed circulant graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:3, pp:129-133 [Journal]
   
3. Gianpaolo Ghiani, Gennaro Improta, Gilbert Laporte
   The capacitated arc routing problem with intermediate facilities. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:3, pp:134-143 [Journal]
   
4. Toshimasa Ishii, Hiroshi Nagamochi, Toshihide Ibaraki
   Multigraph augmentation under biconnectivity and general edge-connectivity requirements. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:3, pp:144-155 [Journal]
   
5. Shien-Ching Hwang, Gen-Huey Chen
   Minimum spanners of butterfly graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:3, pp:156-164 [Journal]
   
6. Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung
   On the construction of combined k-fault-tolerant Hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
   Networks, 2001, v:37, n:3, pp:165-170 [Journal]