L. Sun , J.-L. Wu

On edge colorings of 1-planar graphs without 5-cycles with two chords

M. Benatallah, N. Ikhlef- Eschouf, M. Mihoubi

On the $b$-domatic number of graphs

M. Rajeswari, I. Sahul Hamid

Global dominator coloring of graphs

R. Bailey, I.G. Yero

Error-correcting codes from $k$-resolving sets

N. Haghparast, D. Kiani

Edge-connectivity and edges of even factors of graphs

T.A. McKee

Strongly unichord-free graphs

Y. Mandelshtam

On graphs presentable by pattern-avoiding words

S. Špacapan

On 3-colorings of direct products of graphs

D. Pillone

Arankings of trees

N. Polat

On some characterizations of antipodal partial cubes

X. Liu, Z. Shao, S.M. Sheikholeslami, M. Soroudi, L. Volkmann

On the co-Roman domination in graphs

K. Diao, F. Lu, P. Zhao

More results on the smallest one-realization of a given set II

M. Hajian, N. Jafari Rad

Fair domination number in cactus graphs

H.S. Boregowda, B. Chaluvaraju, V.R. Kulli

The product connectivity Banhatti index of a graph

J. Amjadi, S.M. Sheikholeslami, M. Soroudi

On the total Roman domination in trees

S. Cichacz, B. Freyberg, D. Froncek

Orientable $\mathbb{Z}_{n}$-distance magic graphs

Y.Q. Huang, Z.D. Ouyang, J. Wang

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

R. Li , B. Sheng

The second neighbourhood for bipartite tournaments

L. Volkmann

Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number

R.A. Beeler, T.W. Haynes, K. Murphy

1-restricted optimal rubbling on graphs

B. Benmedjdoub, I. Bouchemakh, É. Sopena

2-distance colorings of integer distance graphs

A. Bickle, A. Schwenk

Minimum edge cuts in diameter 2 graphs