| 7 | -- | 24 | A. Tamil Elakkiya, Appu Muthusamy. Gregarious kite factorization of tensor product of complete graphs |
| 25 | -- | 34 | Mei Lu, Wenjie Ning, Kun Wang. Bounds on the locating-total domination number in trees |
| 35 | -- | 49 | Panpan Li, Wenzhong Liu. Decompositions of cubic traceable graphs |
| 51 | -- | 65 | Stanislav Jendrol', Xueliang Li 0001, Yaping Mao, Yingying Zhang, Haixing Zhao, Xiaoyu Zhu. Conflict-free vertex-connections of graphs |
| 67 | -- | 76 | Tomás Vetrík. On the metric dimension of directed and undirected circulant graphs |
| 77 | -- | 84 | Long Tang, Elkin Vumar. A note on cycles in locally Hamiltonian and locally Hamilton-connected graphs |
| 85 | -- | 106 | Tian Tian, Liming Xiong. 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices |
| 107 | -- | 125 | Vincent E. Coll, Jonelle Hook, Colton Magnant, Karen McCready, Kathleen Ryan. The proper diameter of a graph |
| 127 | -- | 147 | Olivier Hudry, Antoine Lobstein. The compared costs of domination, location-domination and identification |
| 149 | -- | 159 | Zbigniew R. Bogdanowicz. On the minimum number of spanning trees in cubic multigraphs |
| 161 | -- | 179 | Lihua Feng, Minmin Liu, Weijun Liu, Pengli Zhang. k-path-coverable |
| 181 | -- | 194 | Faraha Ashraf, Martin Baca, Susana-Clara López, Francesc Antoni Muntaner-Batle, Akito Oshima, Andrea Semanicová-Fenovcíková. H-irregularity strength of the disjoint union of graphs |
| 195 | -- | 208 | Xihe Li, Ligong Wang 0001. Deficiency and forbidden subgraphs of connected, locally-connected graphs |
| 209 | -- | 225 | David Amos, John Asplund, Boris Brimkov, Randy Davila. k-domination |
| 227 | -- | 241 | Yan Zhao. More on the minimum size of graphs with given rainbow index |
| 243 | -- | 253 | Chang Qing Xu, Xue Zhao. Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles |
| 255 | -- | 268 | Doost Ali Mojdeh, Ahmad Moradi, Omid Sharifi. Roman 2-bondage number of a graph |
| 269 | -- | 277 | Igor Fabrici, Jochen Harant, Samuel Mohr, Jens M. Schmidt. Longer cycles in essentially 4-connected planar graphs |
| 279 | -- | 295 | Martin Sonntag, Hanns-Martin Teichert. Niche hypergraphs of products of digraphs |
| 297 | -- | 305 | Weihua Lu, Han Ren, Chao Yang. Lower bound on the number of Hamiltonian cycles of generalized Petersen graphs |
| 307 | -- | 321 | Andrew Arokiaraj, Sandi Klavzar, Paul D. Manuel, Elizabeth Thomas, Antony Xavier. Strong geodetic problems in networks |
| 323 | -- | 329 | Bojan Vuckovic. An improved upper bound on neighbor expanded sum distinguishing index |
| 331 | -- | 344 | Yuanyuan Duan, Lianying Miao, Wenyao Song. Neighbor sum distinguishing total choosability of IC-planar graphs |
| 345 | -- | 354 | Frantisek Kardos, Mária Maceková, Martina Mockovciaková, Éric Sopena, Roman Soták. Incidence coloring-cold cases |
| 355 | -- | 360 | Maximilian Fürst, Dieter Rautenbach. A short proof for a lower bound on the zero forcing number |