G. T. Chen, R. J. Faudree, R. J. Gould, M.S. Jacobson, L. Lesniak, F. Pfender

Linear forests and ordered cycles

W.F. Klostermeyer, G. MacGillivray

Analogues of cliques for oriented coloring

B.L. Hartnell, D.F. Rall

On dominating the Cartesian product of a graph and $K_2$

T. Madaras

On the structure of plane graphs of minimum face size 5

E. Boros, R.E. Jamison, R.C. Laskar, H.M. Mulder

On 3-simplicial vertices in planar graphs

F. Dahme, D. Rautenbach, L. Volkmann

Some remarks on alpha-domination

M. Kouider, P.D. Vestergaard

Even [a,b]-factors in graphs

M. Pilśniak

Packing of three copies of a digraph into the transitive tournament

T.W. Haynes, M.A. Henning, L.S. Hopkins

Total domination subdivision numbers of graphs

J. Polcyn

Short paths in 3-uniform quasi-random hypergraphs

I.E. Zverovich, O.I. Zverovich

Dominant-matching graphs

S. Bendall, R. Hammack

Centers of n-fold tensor products of graphs

G. Bacsó, Zs. Tuza

Graphs without induced $P_{5}$ and $ C_{5}$

M. Sonntag

Difference labelling of digraphs

H. Galeana-Sánchez

Cycle-pancyclism in bipartite tournaments II

S.M. Zhou

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

L. Haddad, C. Tardif

A clone-theoretic formulation of the Erdős-Faber-Lovász conjecture