| 475 | -- | 485 | Mustafa Atici, Claus Ernst. On the Range of Possible Integrities of Graphs ::::G::::(::::n::::, ::::k::::) |
| 487 | -- | 493 | Rangaswami Balakrishnan, T. Kavaskar. Color Chain of a Graph |
| 495 | -- | 503 | Emanuela Fachini, János Körner. Forbiddance and Capacity |
| 505 | -- | 530 | Michael Goff. Higher Dimensional Moore Bounds |
| 531 | -- | 538 | Nader Jafari Rad, Lutz Volkmann. On the Roman Bondage Number of Planar Graphs |
| 539 | -- | 546 | Petteri Kaski, Veli Mäkinen, Patric R. J. Östergård. The Cycle Switching Graph of the Steiner Triple Systems of Order 19 is Connected |
| 547 | -- | 556 | Kerri Morgan. Pairs of Chromatically Equivalent Graphs |
| 557 | -- | 565 | Stavros D. Nikolopoulos, Charis Papadopoulos. A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs |
| 567 | -- | 584 | Pawel Pralat. Cleaning Random ::::d::::-Regular Graphs with Brooms |
| 585 | -- | 591 | Ioan Tomescu, Muhammad Imran. Metric Dimension and ::::R::::-Sets of Connected Graphs |
| 593 | -- | 602 | Jian Wang, Miao Liang, Beiliang Du. The Spectrum of Tetrahedral Quadruple Systems |
| 603 | -- | 620 | Xiyong Zhang, Hua Guo, Zongsheng Gao. Characterizations of Bent and Almost Bent Function on /mathbb::::Z::::::::::p:::::::::2::: |