L.-P. Zhang; L.G. Wang; J.L. Zhou

The Turán number of spanning star forests

T. James; A. Vijayakumar

Domination game: Effect of edge contraction and edge subdivision

R. Lortz; I. Mengersen

On the Ramsey numbers of non-star trees versus connected graphs of order six

F. Aguilar-Campos; G. Araujo-Pardo; N. García-Colín

Scaffold for the polyhedral embedding of cubic graphs

A. Aashtab; S. Akbari; M. Ghanbari; A. Shidani

Vertex partitioning of graphs into odd induced subgraphs

G.Y. Katona; K. Varga

Strengthening some complexity results on toughness of graphs

T. Dravec; A. Taranenko

Daisy Hamming graphs

J.-H. Yin; B. Wang

About an extremal problem of bigraphic pairs with a realization containing $K_{s,t}$

D.C. Jean; S.J. Seo

Optimal error-detecting open-locating-dominating set on the infinite triangular grid

S. Kogan

A note on forcing 3-repetitions in degree sequences

N.V. Shinde; S.A. Mane; B.N. Waphare

Identifying codes in the direct product of a path and a complete graph

P. Dankelmann; M.J. Morgan; E.J. Rivett-Carnac

Metric dimension and diameter in bipartite graphs

J. Haslegrave

Countable graphs are majority 3-choosable

I. Sciriha; L. Collins

The walks and CDC of graphs with the same main eigenspace

S. Kitaev; A.V. Pyatkin

On semi-transitive orientability of triangle-free graphs

Generalized Turán problems for small graphs

N.D. Tan

A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths