Sommaire du Fascicule no. 1

The crossing numbers of certain Cartesian products
p. 5
Reducible properties of graphs
p. 11
On chromaticity of graphs
p. 19
Problems remaining NP-complete for sparse or dense graphs
p. 33
A note on careful packing of a graph
p. 43
The edge domination problem
p. 51
Edge-disjoint paths in permutation graphs
p. 59
Distinguishing graphs by the number of homomorphisms
p. 73
Hamiltonicity in multitriangular graphs
p. 77
Some maximum multigraphs and edge/vertex distance colourings
p. 89

Sommaire du Fascicule no. 2

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