D.A. Mojdeh; B. Samadi

Total 2-domination number in digraphs and its dual parameter

L. DeBiasio; R.A. Krueger

A note about monochromatic components in graphs of large minimum degree

R. Davila; M.A. Henning; R. Pepper

Zero and total forcing dense graphs

Z.-K. Zhang

Edge-maximal graphs with cutwidth at most three

L. Alcón; M. Gutierrez; C. Hernando; M. Mora; I.M. Pelayo

The neighbor-locating-chromatic number of trees and unicyclic graphs

Z. Skupień

The Petersen and Heawood graphs make up graphical twins via induced matchings

P. Dankelmann; M. DeVilbiss; D.J. Erwin; K. Guest; R. Matzke

On subgraphs with prescribed eccentricities

D.V. Karpov

An upper bound on the chromatic number of 2-planar graphs

L. Volkmann

Double Roman and double Italian domination

X. Zhou; W. Yang; X. Guan; C. Qin

A characterization of internally 4-connected $\{P_{10}− \{v_1,v_2\}\}$-minor-free graphs

J.-C. Godin; O. Togni

Choosability with separation of cycles and outerplanar graphs

S. Zhou; Q. Bian; Z. Sun

Two sufficient conditions for component factors in graphs

F.M. Abdelmalek; E. Vander Meulen; K.N. Vander Meulen; A. Van Tuyl

Well-covered token graphs

B. Ergemlidze; M. Methuku; M. Tait; C. Timmons

Minimizing the number of complete bipartite graphs in a $K_s$-saturated graph

J. Harant; S. Mohr

New bounds on domination and independence in graphs

M.A. Henning; S. Pal; D. Pradhan

Hop domination in chordal bipartite graphs

L. Alcón; M.P. Mazzoleni; T.D. Santos

Relationship among $B_1$-EPG, VPT and EPT graphs classes

M. Carr; C.M. Mynhardt; O.R. Oellermann

Enumerating the digitally convex sets of powers of cycles and Cartesian products of paths and complete graphs