Sommaire

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