| 1 | -- | 6 | Simon Mukwembi. On size, radius and minimum degree |
| 7 | -- | 30 | Christian Löwenstein, Dieter Rautenbach, Roman Sotak. On Hamiltonian Paths and Cycles in Sufficiently Large Distance Graphs |
| 31 | -- | 60 | Milan Bradonjic, Gunes Ercal, Adam Meyerson, Alan Roytman. The Price of Mediation |
| 61 | -- | 72 | Aubrey Blecher, Charlotte A. C. Brennan, Arnold Knopfmacher. Descents after maxima in compositions |
| 73 | -- | 88 | Sylvain Gravier, Svante Janson, Tero Laihonen, Sanna Maarit Ranto. Graphs where every k-subset of vertices is an identifying set |
| 89 | -- | 104 | Frédéric Havet, Andrew King. List circular backbone colouring |
| 105 | -- | 120 | Dorota Kuziak, Iztok Peterin, Ismael González Yero. Efficient open domination in graph products |
| 121 | -- | 142 | Serge Burckel, Emeric Gioan, Emmanuel Thomé. Computation with No Memory, and Rearrangeable Multicast Networks |
| 143 | -- | 158 | Tomás Kaiser, Ondrej Rucký, Matej Stehlík, Riste Skrekovski. Strong parity vertex coloring of plane graphs |
| 159 | -- | 178 | José Carlos Costa. Canonical forms for free κ-semigroups |
| 179 | -- | 200 | Daniel Binkele-Raible, Henning Fernau. An Amortized Search Tree Analysis for Finding a k-Leaf Spanning Tree in an Undirected Graph |
| 201 | -- | 206 | Hosam Abdo, Stephan Brandt, Darko Dimitrov. The Total Irregularity of a Graph |
| 207 | -- | 224 | Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt. The Price of Connectivity for Vertex Cover |
| 225 | -- | 232 | Olivier Baudon, Julien Bensmail, Rafal Kalinowski, Antoni Marczyk, Jakub Przybylo, Mariusz Wozniak. On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph |
| 233 | -- | 286 | Julien Leroy. An S-adic characterization of minimal subshifts with first difference of complexity 1 ≤ p(n+1) - p(n) ≤ 2 |
| 287 | -- | 292 | Jiyun Guo, Jianhua Yin. A forcible version of Niessen's problem on degree sequences of graphs |
| 293 | -- | 302 | Janusz Adamus, Lech Adamus, Anders Yeo. On the Meyniel condition for hamiltonicity in bipartite digraphs |
| 303 | -- | 312 | Alice C. Niemeyer, Cheryl E. Praeger. Elements in finite classical groups whose powers have large 1-Eigenspaces |
| 313 | -- | 326 | Rebecca J. Stones. Computing the number of h-edge spanning forests in complete bipartite graphs |
| 327 | -- | 338 | Toufik Mansour, Mark Shattuck, Mark C. Wilson. Congruence successions in compositions |
| 339 | -- | 354 | Xueliang Li, Yaping Mao. The generalized 3-connectivity of Lexicographic product graphs |
| 356 | -- | 370 | Adrian Tanasa, Gérard Henry Edmond Duchamp, Loïc Foissy, Nguyen Hoang Nghia, Dominique Manchon. A combinatorial non-commutative Hopf algebra of graphs |
| 371 | -- | 394 | Anna Chiara Lai, Paola Loreti. Robot's hand and expansions in non-integer bases |