L. Kang, E. Shan and M. Zhao

Domination in the generalized Petersen graphs

E. Cheng, L.-H. Hsu, C.-N. Hung and M.-C. Yang

2-spanning cyclability problems of the some generalized Petersen graphs

R. Davila and M.A. Henning

Total forcing sets and zero forcing sets in trees

N. Polat

On some properties of antipodal partial cubes

M. Blidia, A. Bouchou and M. Chellali

Extremal graphs for a bound on the Roman domination number

S.-S. Li and J.-H. Yin

On factorable bigraphic pairs

A. Bernshteyn, O. Khormali, R.R. Martin, J. Rollin, D. Rorabaugh, S. Shan and A. Uzzell

Regular colorings in regular graphs

Y. Hu, Y.T. Shi and Y. Wei

The edit distance function of some graphs

Z.-C. Chen and H.-C. Lee

Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars

M. Fürst, M. Gentner, M.A. Henning, S. Jäger and D. Rautenbach

Equating $k$ maximum degrees in graphs without short cycles

A. Brandt, S. Jahanbekam and J. White

Additive list coloring of planar graphs with given girth

S. Alikhani, S. Klavžar, F. Lehner and S. Soltani

Trees with distinguishing index equal distinguishing number plus one

K. Giaro and M. Kubale

A note on polynomial algorithm for cost coloring of bipartite graphs with $\Delta\leq 4$

E. Drgas-Burchardt and E. Sidorowicz

Sum-list colouring of unions of a hypercycle and a path with at most two vertices in common