| 301 | -- | 312 | Lin Sun, Jian-Liang Wu. On edge colorings of 1-planar graphs without 5-cycles with two chords |
| 313 | -- | 324 | Mohammed Benatallah, Noureddine Ikhlef Eschouf, Miloud Mihoubi. b-domatic number of graphs |
| 325 | -- | 339 | M. Rajeswari, Ismail Sahul Hamid. Global dominator coloring of graphs |
| 341 | -- | 355 | Robert Bailey, Ismael González Yero. k-resolving sets |
| 357 | -- | 364 | Nastaran Haghparast, Dariush Kiani. Edge-connectivity and edges of even factors of graphs |
| 365 | -- | 374 | Terry A. McKee. Strongly unichord-free graphs |
| 375 | -- | 389 | Yelena Mandelshtam. On graphs presentable by pattern-avoiding words |
| 391 | -- | 413 | Simon Spacapan. On 3-colorings of direct products of graphs |
| 415 | -- | 437 | Dan Pillone. Arankings of trees |
| 439 | -- | 453 | Norbert Polat. On some characterizations of antipodal partial cubes |
| 455 | -- | 472 | Xinmiao Liu, Zehui Shao, Seyed Mahmoud Sheikholeslami, M. Soroudi, Lutz Volkmann. On the co-Roman domination in graphs |
| 473 | -- | 487 | Kefeng Diao, Fuliang Lu, Ping Zhao. More results on the smallest one-realization of a given set II |
| 489 | -- | 503 | Majid Hajian, Nader Jafari Rad. Fair domination number in cactus graphs |
| 505 | -- | 517 | H. S. Boregowda, B. Chaluvaraju, V. R. Kulli. The product connectivity Banhatti index of a graph |
| 519 | -- | 532 | Jafar Amjadi, Seyed Mahmoud Sheikholeslami, M. Soroudi. On the total Roman domination in trees |
| 533 | -- | 546 | Sylwia Cichacz, Bryan Freyberg, Dalibor Froncek. n-distance magic graphs |
| 547 | -- | 554 | Yuanqiu Huang, Zhangdong Ouyang, Jing Wang. 3, n |
| 555 | -- | 565 | Ruijuan Li, Bin Sheng. The second neighbourhood for bipartite tournaments |
| 567 | -- | 573 | Lutz Volkmann. Sufficient conditions for maximally edge-connected and super-edge-connected graphs depending on the clique number |
| 575 | -- | 588 | Robert A. Beeler, Teresa W. Haynes, Kyle Murphy. 1-restricted optimal rubbling on graphs |
| 589 | -- | 603 | Brahim Benmedjdoub, Isma Bouchemakh, Éric Sopena. 2-distance colorings of integer distance graphs |
| 605 | -- | 608 | Allan Bickle, Allen J. Schwenk. Minimum edge cuts in diameter 2 graphs |