J. Czap, M. Horňák and S. Jendrol'

A survey on the cyclic coloring and its relaxations

H. Aram, N. Dehgardi, S.M. Sheikholeslami, M. Valinavaz and L. Volkmann

Domination, independent domination number and 2-independence number in trees

M. Chen, Y. Li and L. Zhang

Linear list coloring of some sparse graph

T. Madaras and P. Široczki

Minimal graphs with respect to geometric distance realizability

Q. Guo and W. Meng

On the $n$-partite tournaments with exactly $n-m+1$ cycles of length $m$

D.V. Karpov

Large contractible subgraphs of a 3-connected graph

T. Schweser

Generalized hypergraph coloring

W.F. Klostermeyer, M.E. Messinger and A. Yeo

Dominating vertex covers: the vertex-edge domination problem

G.-C. Lau, W.-C. Shiu and H.-K. Ng

On local antimagic chromatic number of cycle-related join graphs

N.R. Aravind and C.R. Subramanian

Intersection dimension and graph invariants

L. Wang, W. Wideł and W. Zheng

On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs

Y. Wang and Y.Q. Huang

The crossing number of Cartesian product of 5-wheels with any tree

L. Hu, L. Sun and J.-L. Wu

List edge coloring of planar graphs without 6-cycles with two chords

A. Cabrera Martínez, I. Peterin and I.G. Yero

Independent transversal total domination versus total domination in trees

B. Brešar, Cs. Bujtás, T. Gologranc, S. Klavžar, G. Košmrlj, T. Marc, B. Patkós, Zs. Tuza and M. Vizer

On Grundy total domination number in product graphs

P. Paulraja and R. Srimathi

Decomposition of the tensor product of complete graphs into cycles of lengths 3 and 6

A. Cabrera Martínez, D. Kuziak and I.G. Yero

A constructive characterization of vertex cover Roman trees

T.A. McKee

Dualizing distance-hereditary graphs

W. Meng

Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments

L. Plachta

Coverings of cubic graphs and 3-edge colorability

R. Hammack

Graph exponentiation and neighborhood reconstruction