Sommaire

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