- Yaojun Chen, Feng Tian, Bing Wei:
**Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta.**1-12

- Curtis Coker:
**Enumerating a class of lattice paths.**13-28

- Luca Ferrari, Elisa Pergola, Renzo Pinzani, Simone Rinaldi:
**Jumping succession rules and their generating functions.**29-50

- Weidong Gao:
**On zero-sum subsequences of restricted size II.**51-59

- Wayne Goddard, Michael Edwin Raines, Peter J. Slater:
**Distance and connectivity measures in permutation graphs.**61-70

- Eline Govaert, Hendrik Van Maldeghem:
**Forgetful polygons as generalizations of semi-affine planes.**71-100

- Michael A. Henning:
**Defending the Roman Empire from multiple attacks.**101-115

- Yuanqiu Huang:
**Maximum genus and chromatic number of graphs.**117-127

- Santosh N. Kabadi, Abraham P. Punnen:
**Weighted graphs with all Hamiltonian cycles of the same length.**129-139

- Alexander K. Kelmans:
**On graph closures.**141-168

- Wensong Lin:
**Some star extremal circulant graphs.**169-177

- Martin Loebl, Jan Vondrák:
**Towards a theory of frustrated degeneracy.**179-193

- Christian Mauduit, András Sárközy:
**On the measures of pseudorandomness of binary sequences.**195-207

- Joseph Samuel Myers:
**The extremal function for unbalanced bipartite minors.**209-222

- Behnaz Omoomi, Yee-Hock Peng:
**Chromatic equivalence classes of certain generalized polygon trees, III.**223-234

- Milos Stojakovic:
**Limit shape of optimal convex lattice polygons in the sense of different metrics.**235-249

- Zbigniew Switalski:
**Half-integrality of vertices of the generalized transitive tournament polytope (**251-260*n*=6).

- René van den Brink, Robert P. Gilles:
**Ranking by outdegree for directed graphs.**261-270

- Joshua Von Korff:
**Classification of greedy subset-sum-distinct-sequences.**271-282

- Steve Wilson:
**A worthy family of semisymmetric graphs.**283-294

- Dezheng Xie, Wanlian Yang:
**The total chromatic number of graphs of even order and high degree.**295-302

- Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo:
**On a tree graph defined by a set of cycles.**303-310

- Pierre Lalonde:
**Lattice paths and the antiautomorphism of the poset of descending plane partitions.**311-319

- Lian-ying Miao, Shi-you Pang, Jian-liang Wu:
**An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree.**321-325

- Nedyalko Dimov Nenov:
**On the triangle vertex Folkman numbers.**327-334

- Dieter Rautenbach:
**A note on trees of maximum weight and restricted degrees.**335-342

- Gelasio Salazar:
**Infinite families of crossing-critical graphs with given average degree.**343-350