Sommaire

Linear forests and ordered cycles
p. 359
Analogues of cliques for oriented coloring
p. 373
On dominating the Cartesian product of a graph and K₂
p. 389
On the structure of plane graphs of minimum face size 5
p. 403
On 3-simplicial vertices in planar graphs
p. 413
Some remarks on α-domination
p. 423
Even [a,b]-factors in graphs
p. 431
Packing of three copies of a digraph into the transitive tournament
p. 443
Total domination subdivision numbers of graphs
p. 457
Short paths in 3-uniform quasi-random hypergraphs
p. 469
Dominant-matching graphs
p. 485
Centers of n-fold tensor products of graphs
p. 491
Graphs without induced P₅ and C₅
p. 503
Difference labelling of digraphs
p. 509
Cycle-pancyclism in bipartite tournaments II
p. 529
A Gallai-type equality for the total domination number of a graph
p. 539
A clone-theoretic formulation of the Erdos-Faber-Lovász conjecture
p. 545