Journals in DBLP

Inf. Process. Lett.
2006, volume: 99, number: 2

1. Angelika Hellwig, Lutz Volkmann
   Lower bounds on the vertex-connectivity of digraphs and graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:2, pp:41-46 [Journal]
   
2. Min Chen, Weifan Wang
   The 2-dipath chromatic number of Halin graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:2, pp:47-53 [Journal]
   
3. Amitabha Bagchi, Ankur Bhargava, Torsten Suel
   Approximate maximum weight branchings. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:2, pp:54-58 [Journal]
   
4. Kathie Cameron, Chính T. Hoàng
   On the structure of certain intersection graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:2, pp:59-63 [Journal]
   
5. Chung-Ming Lin, Yin-Te Tsai, Chuan Yi Tang
   Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:2, pp:64-67 [Journal]
   
6. Mickaël Montassier
   A note on the not 3-choosability of some families of planar graphs. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:2, pp:68-71 [Journal]
   
7. Olga Xirotiri
   Simulation of simultaneous safe recursion over an arbitrary structure. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2006, v:99, n:2, pp:72-81 [Journal]