O.V. Borodin, A.O. Ivanova

All tight descriptions of 3-stars in 3-polytopes with girth 5

Y. Metelsky, K. Schemeleva, F. Werner

A finite characterization and recognition of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 in the class of thresholds graphs

E. Flandrin, H. Li, A. Marczyk, J.F. Saclé, M. Woźniak

A note on neighbor expanded sum distinguishing index

L. Asgharsharghi, S.M. Sheikholeslami, L. Volkmann

Signed Roman edge $k$-domination in graphs

D. Froncek

Decomposition of certain complete bipartite graphs into prisms

W.F. Klostermeyer, G. MacGillivray

Eternal domination: criticality and reachability

E. Hexel

On the $H$-force number of Hamiltonian graphs and cycle extendability

O. Baudon, J. Bensmail, F. Foucaud, M. Pilśniak

Structural properties of recursively partitionable graphs with connectivity 2

P. R. Garcia-Vázquez, C. Hernández-Cruz

Some results on 4-transitive digraphs

B.Y. Bam, C. M. Deshpande, L. N. Kamble

Almost self-complementary 3-uniform hypergraphs

X. Li, H. Li , Y. Sun

Rainbow connection number of graphs with diameter 3

E. Estaji, W. Imrich, R. Kalinowski, M. Pilśniak, T. Tucker

Distinguishing Cartesian products of countable graphs

P. Immel, P.S. Wenger

The list distinguishing number equals the distinguishing number for interval graphs

H. Belkhechine, P. Ille, R.E. Woodrow

Criticality of switching classes of reversible 2-structures labeled by an Abelian group

J. Bensmail

On $q$-power cycles in cubic graphs

N. Javier, B. Llano

The dichromatic number of infinite families of circulant tournaments

S. Cichacz, M. Nikodem

Union of distance magic graphs

J.-Y. Guo, J.-H. Yin

A constructive extension of the characterization on potentially $K_{s,t}$-bigraphic pairs

L. Volkmann

Signed total Roman domination in digraphs

D. Kuziak, J.A. Rodríguez-Velázquez, I.G. Yero

Computing the metric dimension of a graph from primary subgraphs