Sommaire

The chromatic equivalence class of graph $\overline{B_{n-6,1,2}}$
p. 189
The Wiener number of Kneser graphs
p. 219
Minimal cycle bases of the lexicographic product of graphs
p. 229
On the structure of path-like trees
p. 249
Secure domination and secure total domination in graphs
p. 267
Monochromatic paths and quasi-monochromatic cycles in edge-coloured bipartite tournaments
p. 285
Clique irreducibility of some iterative classes of graphs
p. 307
On acyclic colorings of direct products
p. 323
A note on domination parameters in random graphs
p. 335
An upper bound on the Laplacian spectral radius of the signed graphs
p. 345
A remark on the (2,2)-domination number
p. 361
Ordered and linked chordal graphs
p. 367
Solution to the problem of Kubesa
p. 375