| 1151 | -- | 1174 | M. R. Alfuraidan. Bipartite Distance-Transitive Doubles with Primitive Halved of Diameter Two |
| 1175 | -- | 1181 | Saeid Alikhani. The Domination Polynomial of a Graph at -1 |
| 1183 | -- | 1191 | Csaba Biró, Zoltán Füredi, Sogol Jahanbekam. Large Chromatic Number and Ramsey Graphs |
| 1193 | -- | 1206 | Izak Broere, Johannes Heidema. Universal H-Colourable Graphs |
| 1207 | -- | 1219 | Javier Cano, José Miguel Díaz-Báñez, Clemens Huemer, Jorge Urrutia. The Edge Rotation Graph |
| 1221 | -- | 1234 | Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman. Helly Numbers of Polyominoes |
| 1235 | -- | 1247 | Lily Chen, Xueliang Li, Huishu Lian. Nordhaus-Gaddum-Type Theorem for Rainbow Connection Number of Graphs |
| 1249 | -- | 1257 | Xiaodan Chen, Jianguo Qian. Laplacian Spectral Radius and Maximum Degree of Trees with Perfect Matchings |
| 1259 | -- | 1267 | Xiaodong Chen, MingChu Li, Xin Ma, Xinxin Fan. Hamiltonian Connectedness in Claw-Free Graphs |
| 1269 | -- | 1286 | Andrzej Dudek, Oleg Pikhurko, Andrew Thomason. On Minimum Saturated Matrices |
| 1287 | -- | 1304 | Paolo Dulio, Virgilio Pannone. Iterated Joining of Rooted Trees |
| 1305 | -- | 1309 | Tomasz Dzido. A Note on Turán Numbers for Even Wheels |
| 1311 | -- | 1327 | Reinhardt Euler, Tudor Zamfirescu. On Planar Toeplitz Graphs |
| 1329 | -- | 1336 | Evelyne Flandrin, Antoni Marczyk, Jakub Przybylo, Jean-François Saclé, Mariusz Wozniak. Neighbor Sum Distinguishing Index |
| 1337 | -- | 1345 | Yunshu Gao, Guojun Li, Jin Yan. Neighborhood Unions for the Existence of Disjoint Chorded Cycles in Graphs |
| 1347 | -- | 1353 | Jesús García-López, Carlos M. Nicolás. Planar Point Sets With Large Minimum Convex Decompositions |
| 1355 | -- | 1364 | Dániel Gerbner, Balázs Keszegh, Nathan Lemons, Cory Palmer, Dömötör Pálvölgyi, Balázs Patkós. Saturating Sperner Families |
| 1365 | -- | 1375 | Salman Ghazal. A Contribution to the Second Neighborhood Problem |
| 1377 | -- | 1389 | Ebrahim Ghorbani. Graphs With Few Matching Roots |
| 1391 | -- | 1402 | Alexander Halperin, Colton Magnant, Daniel M. Martin. On Distance Between Graphs |
| 1403 | -- | 1416 | Aleksandar Ilic, Milovan Ilic. Generalizations of Wiener Polarity Index and Terminal Wiener Index |
| 1417 | -- | 1427 | Kaveh Khoshkhah, M. Nemati, Hossein Soltani, Manouchehr Zaker. A Study of Monopolies in Graphs |
| 1429 | -- | 1441 | K. M. Koh, Zi-Xia Song. On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two |
| 1443 | -- | 1452 | Khee Meng Koh, Zeinab Maleki, Behnaz Omoomi. An Upper Bound for the Total Restrained Domination Number of Graphs |
| 1453 | -- | 1458 | Vadim E. Levit, Eugen Mandrescu. When is G 2 a König-Egerváry Graph? |
| 1459 | -- | 1469 | Hao Li, Junqing Cai, Wantao Ning. An Implicit Degree Condition for Pancyclicity of Graphs |
| 1471 | -- | 1475 | Xueliang Li, Yongtang Shi. Rainbow Connection in 3-Connected Graphs |
| 1477 | -- | 1488 | Hongjuan Liu, Lidong Wang. Super-Simple Resolvable Balanced Incomplete Block Designs with Block Size 4 and Index 4 |
| 1489 | -- | 1499 | T. H. Marshall. Homomorphism Bounds for Oriented Planar Graphs of Given Minimum Girth |
| 1501 | -- | 1516 | Zhaoping Meng, Beiliang Du. The Existence of Augmented Resolvable Candelabra Quadruple Systems with Three Even Groups |
| 1517 | -- | 1522 | Juan José Montellano-Ballesteros, Eduardo Rivera-Campo. On the Heterochromatic Number of Hypergraphs Associated to Geometric Graphs and to Matroids |
| 1523 | -- | 1529 | Faisal Nadeem, Ayesha Shabbir, Tudor Zamfirescu. Planar Lattice Graphs with Gallai's Property |
| 1531 | -- | 1541 | Zh. G. Nikoghosyan. Advanced Lower Bounds for the Circumference |
| 1543 | -- | 1547 | Yoshio Sano. A Generalization of Opsut's Lower Bounds for the Competition Number of a Graph |
| 1549 | -- | 1555 | Brian C. Wagner. Ascending Subgraph Decompositions in Oriented Complete Balanced Tripartite Graphs |
| 1557 | -- | 1567 | Chengmin Wang, Charles J. Colbourn. The Existence of (K 2 × K 6)-Designs |
| 1569 | -- | 1575 | Wei Wang, Zhidan Yan. On the Edge Connectivity of Direct Products with Dense Graphs |