G. Dai

The existence of path-factor covered graphs

J.B. Saraf; Y.M. Borse; G. Mundhe

On conditional connectivity of the Cartesian product of cycles

T.W. Haynes; M.A. Henning

Unique minimum semipaired dominating sets in trees

J.A. White

Burnside chromatic polynomials of group-invariant graphs

Y. Büyükçolak; D. Gözüpek; S. Özkan

Equimatchable bipartite graphs

A. Burcroff

Domination parameters of the unitary Cayley graph of $\mathbb{Z}/n\mathbb{Z}$

W. F. Klostermeyer; G. MacGillivray; S.M. Semnani; F. Piri

Efficient $(j, k)$-dominating functions

J. Martí-Farré; M. Mora; M.L. Puertas; J.L. Ruiz

Elimination properties for minimal dominating sets of graphs

K. Štorgel

Improved bounds for some facially constrained colorings

P. Wocjan; C. Elphick; D. Anekstein

More tales of Hoffman: bounds for the vector chromatic number of a graph

H. Shibuya; Y. Suzuki

A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces

Y. Tian; H.-J. Lai; J. Meng; M. Xu

On the sizes of $(k,l)$-edge-maximal $r$-uniform hypergraphs

L. Mol; M.J.H. Murphy; O.R. Oellermann

The threshold dimension and irreducible graphs

X. Yang; L. Xiong

Forbidden subgraphs for existences of (connected) 2-factors of a graph

L. Lesniak; H. Thuiller; A.P. Wojda

Extending Potočnik and Šajna's conditions on the existence of vertex-transitive self-complementary $k$-hypergraphs

S. Zhou

Some results on path-factor critical avoidable graphs

A. Hakanen; V. Junnila; T. Laihonen; M.L. Puertas

On the metric dimensions for sets of vertices

P. Borg; C. Feghali

The Hilton-Spencer cycle theorems via Katona's shadow intersection theorem

S. Sribunhung; K. M. Nakprasit; K. Nakprasit; P. Sittitrai

Relaxed DP-coloring and another generalization of DP-coloring on planar graphs without $4$-cycles and $7$-cycles