1995/15/2

Spanning caterpillars with bounded diameter

Efficient algorithms for minimal disjoint path problems on chordal graphs

A linear algorithm for the two paths problem on permutation graphs

Stronger bounds for generalized degrees and Menger path systems

The flower conjecture in special classes of graphs

Generalized list colourings of graphs

On the factorization of reducible properties of graphs into irreducible factors

Vizing's conjecture and the one-half argument