G.T. Chen; Z.Q. Hu; Y.P. Wu

A Chvátal-Erdős type theorem for path-connectivity

M. Anholcer; A.S. Emadi; D.A. Mojdeh

Total vertex product irregularity strength of graphs

J. Tian; S. Klavžar

Graphs with total mutual-visibility number zero and total mutual-visibility in Cartesian products

D. A. Kalarkop; I. Sahul Hamid; M. Chellali; R. Rangarajan

Global dominated coloring of graphs

Y. Lin; W. Lin

Strong chromatic index of claw-free graphs with edge weight seven

C. Tardif

Chromatic Ramsey numbers of generalised Mycielski graphs

S. Gravier; H. Signargout; S. Slimani

Optimal adjacent vertex-distinguishing edge-colorings of circulant graphs

P. Dorbec; F. Kaci

Disjoint maximal independent sets in graphs and hypergraphs

Y.-P. Liang; J. Chen; S.-J. Xu

Semitotal forcing in claw-free cubic graphs

F. Devvrit; A. Krim-Yee; N. Kumar; G. MacGillivray; B. Seamone; V. Virgile; A. Xu

Fractional eternal domination: securely distributing resources across a network

L. Lei; X. Li; S. Song; Y. Xie; H.-J. Lai

Spanning trails avoiding and containing given edges

D.L. de Oliveira; D. Artigas; S. Dantas; A.G. Luiz

On the edge-sum distinguishing game

S. Cichacz; A. Gőrlich; K. Suchan

$k$-fault-tolerant graphs for $p$ disjoint complete graphs of order $c$

J. Sen; S.R. Kola

Critical aspects in broadcast domination

J. Deng; J. Hou; Q. Zeng

The Turán number of three disjoint paths

D. Gerbner

On weakly Turán-good graphs

S. Alikhani; D. Bakhshesh; H.R. Golmohammadi; E.V. Konstantinova

Connected coalitions in graphs

J. Barát; Z.L. Blázsik

General sharp upper bounds on the total coalition number

J. Chen; Y.-P. Liang; S.-J. Xu

Semitotal domination in claw-free graphs

M. Litka

Online size Ramsey number for $C_4$ and $P_6$

L. Fu; J. Wang; W. Yang

The maximum number of edges in a $\{K_{r+1},M_{k+1}\}$-free graph

J. Goedgebeur; T. Gringore; C.T. Zamfirescu

On non-hamiltonian polyhedra without cubic vertices and their vertex-deleted subgraphs