| 149 | -- | 160 | Robert A. Beeler, Robert E. Jamison. Automorphic Decompositions of Graphs |
| 161 | -- | 170 | Elizabeth J. Billington, Italo J. Dejter, Dean G. Hoffman, Charles Curtis Lindner. Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles |
| 171 | -- | 175 | Vasek Chvátal. Comparison of Two Techniques for Proving Nonexistence of Strongly Regular Graphs |
| 177 | -- | 186 | David Galvin, Yufei Zhao. The Number of Independent Sets in a Graph with Small Maximum Degree |
| 187 | -- | 197 | Han Ren, Yanbo Gao. Lower Bound of the Number of Maximum Genus Embeddings and Genus Embeddings of ::::K::::::12::::s::::+7:: |
| 199 | -- | 206 | Roman Kuzel, Jakub Teska. On 2-Connected Spanning Subgraphs with Bounded Degree in ::::K::::::1, ::::r::::::-Free Graphs |
| 207 | -- | 214 | Hong-Jian Lai, Hao Li, Yehong Shao, Mingquan Zhan. On 3-Edge-Connected Supereulerian Graphs |
| 215 | -- | 229 | Arbind Kumar Lal, Kamal Lochan Patra, Binod Kumar Sahoo. Algebraic Connectivity of Connected Graphs with Fixed Number of Pendant Vertices |
| 231 | -- | 241 | Edita Mácajová, Martin Skoviera. Infinitely Many Hypohamiltonian Cubic Graphs of Girth 7 |
| 243 | -- | 249 | Klas Markström, Andrew Thomason, Peter Wagner 0002. Properly Edge-Coloured Subgraphs in Colourings of Bounded Degree |
| 251 | -- | 267 | Margaret-Ellen Messinger, Richard J. Nowakowski, Pawel Pralat. Cleaning with Brooms |
| 269 | -- | 273 | G. R. Omidi. A Note on Group Choosability of Graphs with Girth at least 4 |
| 275 | -- | 287 | Yingzhi Tian, Jixiang Meng. Superconnected and Hyperconnected Small Degree Transitive Graphs |
| 289 | -- | 303 | Jun Yuan, Aixia Liu. The ::::k::::-Restricted Edge Connectivity of Balanced Bipartite Graphs |