Sommaire

Independent transversal domination in graphs
p. 5
Median of a graph with respect to edges
p. 19
List coloring of complete multipartite graphs
p. 31
On total vertex irregularity strength of graphs
p. 39
Embeddings of hamiltonian paths in faulty k-ary 2-cubes
p. 47
Vertex rainbow colorings of graphs
p. 63
Recognizable colorings of cycles and trees
p. 81
The projective plane crossing number of the circulant graph C(3k;{1,k})
p. 91
Double geodetic number of a graph
p. 109
p-Wiener intervals and p-Wiener free intervals
p. 121
The k-rainbow domatic number of a graph
p. 129
2-distance 4-colorability of planar subcubic graphs with girth at least 22
p. 141
On a generalization of the friendship theorem
p. 153
Characterizing Cartesian fixers and multipliers
p. 161
Parity vertex colorings of binomial trees
p. 177
The first player wins the one-colour triangle avoidance game on 16 vertices
p. 181