2004/24/3

Linear forests and ordered cycles

Analogues of cliques for oriented coloring

On dominating the Cartesian product of a graph and K₂

On the structure of plane graphs of minimum face size 5

On 3-simplicial vertices in planar graphs

Some remarks on α-domination

Even [a,b]-factors in graphs

Packing of three copies of a digraph into the transitive tournament

Total domination subdivision numbers of graphs

Short paths in 3-uniform quasi-random hypergraphs

Dominant-matching graphs

Centers of n-fold tensor products of graphs

Graphs without induced P₅ and C₅

Difference labelling of digraphs

Cycle-pancyclism in bipartite tournaments II

A Gallai-type equality for the total domination number of a graph

A clone-theoretic formulation of the Erdos-Faber-Lovász conjecture