| 303 | -- | 312 | Lin-peng Zhang, Ligong Wang 0001, Jiale Zhou. The Turán number of spanning star forests |
| 313 | -- | 329 | Tijo James, Ambat Vijayakumar. Domination game: Effect of edge contraction and edge subdivision |
| 331 | -- | 349 | Roland Lortz, Ingrid Mengersen. On the Ramsey numbers of non-star trees versus connected graphs of order six |
| 351 | -- | 384 | Flor Aguilar-Campos, Gabriela Araujo-Pardo, Natalia García-Colín. Scaffold for the polyhedral embedding of cubic graphs |
| 385 | -- | 399 | Arman Aashtab, Saieed Akbari, Maryam Ghanbari, Amitis Shidani. Vertex partitioning of graphs into odd induced subgraphs |
| 401 | -- | 419 | Gyula Y. Katona, Kitti Varga. Strengthening some complexity results on toughness of graphs |
| 421 | -- | 436 | Tanja Dravec, Andrej Taranenko. Daisy Hamming graphs |
| 437 | -- | 444 | Jianhua Yin, Bing Wang. s, t |
| 445 | -- | 455 | Devin C. Jean, Suk Jai Seo. Optimal error-detecting open-locating-dominating set on the infinite triangular grid |
| 457 | -- | 462 | Shimon Kogan. A note on forcing 3-repetitions in degree sequences |
| 463 | -- | 486 | Neeta Shinde, Smruti Mane, Baloo Waphare. Identifying codes in the direct product of a path and a complete graph |
| 487 | -- | 498 | Peter Dankelmann, Jane Morgan, Emily Rivett-Carnac. Metric dimension and diameter in bipartite graphs |
| 499 | -- | 506 | John Haslegrave. Countable graphs are majority 3-choosable |
| 507 | -- | 532 | Irene Sciriha, Luke Collins. The walks and CDC of graphs with the same main eigenspace |
| 533 | -- | 547 | Sergey Kitaev, Artem V. Pyatkin. On semi-transitive orientability of triangle-free graphs |
| 549 | -- | 572 | Dániel Gerbner. Generalized Turán problems for small graphs |
| 573 | -- | 581 | Ngo Dac Tan. A decomposition for digraphs with minimum outdegree 3 having no vertex disjoint cycles of different lengths |