| 0 | -- | 0 | Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis. Connected Tropical Subgraphs in Vertex-Colored Graphs |
| 0 | -- | 0 | Yoomi Rho, Aleksander Vesel. h(111) |
| 0 | -- | 0 | Deyan Zeng, Jian-Hua Yin. An extremal problem for a graphic sequence to have a realization containing every 2-tree with prescribed size |
| 1 | -- | 12 | Hongliang Lu. Vertex-Coloring Edge-Weighting of Bipartite Graphs with Two Edge Weights |
| 13 | -- | 30 | Jean-Luc Baril. Avoiding patterns in irreducible permutations |
| 31 | -- | 42 | Julien Bensmail, Romaric Duvignau, Sergey Kirgizov. The complexity of deciding whether a graph admits an orientation with fixed weak diameter |
| 43 | -- | 58 | Julien Bensmail, Brett Stevens. Edge-partitioning graphs into regular and locally irregular components |
| 59 | -- | 76 | Jacobus H. Koolen, Woo-Sun Lee, William J. Martin, Hajime Tanaka. Arithmetic completely regular codes |
| 77 | -- | 90 | Adrian Tanasa, Nguyen Hoang Nghia, Christophe Tollu. Dendriform structures for restriction-deletion and restriction-contraction matroid Hopf algebras |
| 90 | -- | 104 | Susana-Clara López, Francesc A. Muntaner-Batle. Rainbow eulerian multidigraphs and the product of cycles |
| 105 | -- | 130 | Milan Erdelj, Nathalie Mitton, Tahiry Razafindralambo. Robust Wireless Sensor Network Deployment |
| 131 | -- | 146 | Marthe Bonamy, Benjamin Lévêque, Alexandre Pinlou. 4 are minimally edge and total choosable |
| 147 | -- | 166 | Armend Shaban Shabani, Gjergji Rexhep. Statistics for 3-letter patterns with repetitions in compositions |
| 167 | -- | 178 | Tara Brough, Laura Ciobanu, Murray Elder, Georg Zetzsche. Permutations of context-free, ET0L and indexed languages |
| 179 | -- | 202 | Inna Mikhaylova. A proof of Zhil'tsov's theorem on decidability of equational theory of epigroups |
| 203 | -- | 216 | Jianxi Li, Yang Liu, Wai Chee Shiu. The irregularity of two types of trees |
| 217 | -- | 226 | Arash Ahadi, Ali Dehghan 0001. The inapproximability for the (0, 1)-additive number |
| 227 | -- | 244 | Xiaoyan Zhang, Zan-Bo Zhang, Hajo Broersma, Xuelian Wen. On the complexity of edge-colored subgraph partitioning problems in network optimization |
| 245 | -- | 262 | Johan de Wet, Susan A. van Aardt. Traceability of locally hamiltonian and locally traceable graphs |
| 263 | -- | 284 | Paulraja Palanivel Subramania Nadar, S. Sampath Kumar. Edge Disjoint Hamilton Cycles in Knödel Graphs |
| 285 | -- | 306 | Marek Klonowski, Malgorzata Sulkowska. Energy-optimal algorithms for computing aggregative functions in random networks |
| 307 | -- | 314 | Shih-Yan Chen, Shin-Shin Kao, Hsun Su. On degree-sequence characterization and the extremal number of edges for various Hamiltonian properties under fault tolerance |