| 1 | -- | 10 | Boram Park, Yoshio Sano. The competition number of a generalized line graph is at most two |
| 11 | -- | 20 | Yoshio Okamoto, Yota Otachi, Ryuhei Uehara. On bipartite powers of bigraphs |
| 21 | -- | 28 | Mirko Hornák, Mariusz Wozniak. On neighbour-distinguishing colourings from lists |
| 29 | -- | 36 | Robert H. Sloan, Despina Stasi, György Turán. Random Horn Formulas and Propagation Connectivity for Directed Hypergraphs |
| 37 | -- | 56 | Raffaele Mosca. 6-Free Graphs and Generalizations |
| 57 | -- | 74 | Laurent Gourvès, Adria Ramos de Lyra, Carlos A. J. Martinhon, Jérôme Monnot. On paths, trails and closed trails in edge-colored graphs |
| 75 | -- | 82 | Dieter Rautenbach, Friedrich Regen. Graphs with many Vertex-Disjoint Cycles |
| 83 | -- | 90 | Manuel E. Lladser, Primoz Potocnik, Jozef Sirán, Mark C. Wilson. Random Cayley digraphs of diameter 2 and given degree |
| 91 | -- | 128 | Helmut Prodinger, Guy Louchard. The Asymmetric Leader Election Algorithm with swedish stopping: A probabilistic analysis |
| 129 | -- | 154 | Diether Knof, Uwe Roesler. The Analysis of Find and Versions of it |
| 155 | -- | 164 | Faisal N. Abu-Khzam, Michael A. Langston. Immersion Containment and Connectivity in Color-Critical Graphs |
| 165 | -- | 172 | Manu Basavaraju. Acyclic Chromatic Index of Fully Subdivided Graphs and Halin Graphs |
| 173 | -- | 188 | Sanming Zhou. On 4-valent Frobenius circulant graphs |
| 189 | -- | 204 | Hermann Gruber. Digraph Complexity Measures and Applications in Formal Language Theory |
| 205 | -- | 228 | Per Austrin, Siavosh Benabbas, Avner Magen. On Quadratic Threshold CSPs |
| 229 | -- | 254 | Vera Koponen. Random graphs with bounded maximum degree: asymptotic structure and a logical limit law |
| 255 | -- | 260 | Guofei Zhou, Yaojun Chen, Zhengke Miao, Shariefuddin Pirzada. A Note on Planar Ramsey Numbers for a Triangle Versus Wheels |
| 261 | -- | 270 | Hossein Hajiabolhassan, Farokhlagha Moazami. Secure Frameproof Code Through Biclique Cover |
| 271 | -- | 284 | Marie Albenque, Lucas Gerin. On the algebraic numbers computable by some generalized Ehrenfest urns |
| 285 | -- | 292 | Gerard Jennhwa Chang, Paul Dorbec, Hye Kyung Kim, André Raspaud, Haichao Wang, Weiliang Zhao. Upper k-tuple domination in graphs |