Geodesic

Volume 15 (1995) no. 2

Sommaire

Spanning caterpillars with bounded diameter
p. 111-118
Efficient algorithms for minimal disjoint path problems on chordal graphs
p. 119-145
A linear algorithm for the two paths problem on permutation graphs
p. 147-166
Stronger bounds for generalized degrees and Menger path systems
p. 167-177
The flower conjecture in special classes of graphs
p. 179-184
Generalized list colourings of graphs
p. 185-193
On the factorization of reducible properties of graphs into irreducible factors
p. 195-203
Vizing's conjecture and the one-half argument
p. 205-216