F. Septyanto; K.A. Sugeng

Distance-local rainbow connection number

D. Ikegami; A. Nakamoto

Flippable edges in triangulations on surfaces

P. Patkós; Zs. Tuza; M. Vizer

Singular Turán numbers and WORM-colorings

J. Ivančo; A. Onderko

On $\mathrm M_f$-edge colorings of graphs

M. Xie; C. Zhou

Decomposing 10-regular graphs into paths of length 5

H. Alizadeh; D. Gözüpek; G. Boruzanli Ekinci

$(C_3, C_4, C_5, C_7)$-free almost well-dominated graphs

S.-S. Li; J.-H. Yin; J.-Y. Li

The Turán number for $4\cdot S_\ell$

F. Azvin; N. Jafari Rad

Bounds on the double Italian domination number of a graph

A. Brandstädt; R. Mosca

Finding dominating induced matchings in $P_9$-free graphs in polynomial time

M. Klešč; M. Staš

Cyclic permutations in determining crossing numbers

X. Bai; R. Chang; Z. Huang; X. Li

More on the rainbow disconnection in graphs

K.C. Deng; Y.F. Li

Antimagic labeling of some biregular bipartite graphs

Y. Caro; J. Lauri; C. Zarb

On small balanceable, strongly-balanceable and omnitonal graphs

J. Bensmail; B. Li

More aspects of arbitrarily partitionable graphs

H. Z. Q. Chen; S. Kitaev; A. Saito

Representing split graphs by words

J.P. de Wet; M. Frick

Nested locally Hamiltonian graphs and the Oberly-Sumner Conjecture

F. Ramezani; P. Rowlinson; Z. Stanić

More on signed graphs with at most three eigenvalues

V. Rödl; A. Ruciński

Covering the edges of a random hypergraph by cliques

N. Bašić; P.W. Fowler; T. Pisanski; I. Sciriha

On singular signed graphs with nullspace spanned by a full vector: signed nut graphs

J. Konarski; M. Woźniak; A. Żak

A note on packing of uniform hypergraphs