M. Furuya; S. Maezawa; R. Matsubara; H. Matsuda; S. Tsuchiya; T. Yashima

Degree sum condition for the existence of spanning $\boldsymbol{k}$-trees in star-free graphs

B. Pahlavsay; E. Palezzato; M. Torielli

3-tuple total domination number of rook's graphs

L. Colucci; E. Győri

On $L(2,1)$-labelings of oriented graphs

R. Givens; G. Yu; R. Kincaid

Open locating-dominating sets in circulant graphs

D. Dyer; J. Howell

Bounds on watching and watching graph products

J.J. Lin; M.J. Jou

Minimum coverings of crowns with cycles and stars

P. Sittitrai; K. Nakprasit

An analogue of DP-coloring for variable degeneracy and its applications

B. Durhuus; A. Lucia

Recursion relations for chromatic coefficients for graphs and hypergraphs

D. Bokal; J. Jerebic

Guarding a subgraph as a tool in pursuit-evasion games

D.J. Klein; J.A. Rodríguez-Velázquez

Protection of lexicographic product graphs

J. Bensmail; F. Mc Inerney; K. Szabo Lyngsie

On $\{a,b\}$-edge-weightings of bipartite graphs with odd $a,b$

W. Zheng; H.J. Broersma; L. Wang

Toughness, forbidden subgraphs, and Hamiltonian-connected graphs

J. Wang; J.L. Cai; S.X. Lv; Y.Q. Huang

The crossing number of hexagonal graph $H_{3,n}$ in the projective plane

M. Hasheminezhad; B.D. McKay

Asymptotic enumeration of non-uniform linear hypergraphs

M.A. Henning; S. Pal; D. Pradhan

The semitotal domination problem in block graphs

A. Kemnitz; M. Marangio

On the $\rho$-edge stability number of graphs

J. Wang

Packing trees in complete bipartite graphs

W. Hochstättler; R. Steiner

The star dichromatic number

M. Miotk; P. Żylinski

Spanning trees with disjoint dominating and 2-dominating sets

E. Mohr; D. Rautenbach

On Hamiltonian cycles in claw-free cubic graphs

P.G.N. Szabó

Corrigendum to: Bounds on the number of edges of edge-minimal, edge-maximal and $l$-hypertrees [Discussiones Mathematicae Graph Theory, 36 (2016) 259–278]