| 0 | -- | 0 | Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro. On the connectivity of the disjointness graph of segments of point sets in general position in the plane |
| 0 | -- | 0 | Kenjiro Takazawa. Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs |
| 0 | -- | 0 | Angsuman Das, Hiranya Kishore Dey. Determining Number of Kneser Graphs: Exact Values and Improved Bounds |
| 0 | -- | 0 | Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge. Constant Congestion Brambles |
| 0 | -- | 0 | Julien Baste, Stefan Ehard, Dieter Rautenbach. Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree |
| 0 | -- | 0 | Toufik Mansour, Mark Shattuck. Further enumeration results concerning a recent equivalence of restricted inversion sequences |
| 0 | -- | 0 | Lukasz Bozyk, Michal Pilipczuk. On the Erdős-Pósa property for immersions and topological minors in tournaments |
| 0 | -- | 0 | Michel Rigo, Manon Stipulanti. Automatic sequences: from rational bases to trees |
| 0 | -- | 0 | Jovana Forcan, Mirjana Mikalacki. Maker-Breaker total domination game on cubic graphs |
| 0 | -- | 0 | Jesse Racicot, Giovanni Rosso. Domination in Knödel Graphs |
| 0 | -- | 0 | Márcia R. Cappelle, Erika M. M. Coelho, Les R. Foulds, Humberto J. Longo. Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs |
| 0 | -- | 0 | Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná 0001, Karolina Okrasa. Tuza's Conjecture for Threshold Graphs |
| 0 | -- | 0 | Nicolas Ollinger, Guillaume Theyssier. Freezing, Bounded-Change and Convergent Cellular Automata |
| 0 | -- | 0 | Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood. Separating layered treewidth and row treewidth |
| 0 | -- | 0 | Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk. Down-step statistics in generalized Dyck paths |
| 0 | -- | 0 | Ruy Fabila Monroy, Jesús Leaños, Ana Laura Trujillo-Negrete. On the Connectivity of Token Graphs of Trees |
| 0 | -- | 0 | Daniel Birmajer, Juan B. Gil, David S. Kenepp, Michael D. Weiner. Restricted generating trees for weak orderings |
| 0 | -- | 0 | Isolde Adler, Noleen Köhler. An explicit construction of graphs of bounded degree that are far from being Hamiltonian |
| 0 | -- | 0 | Anna M. Brandenberger, Luc Devroye, Marcel K. Goh, Rosie Zhao. Leaf multiplicity in a Bienaymé-Galton-Watson tree |
| 0 | -- | 0 | Sittipong Thamrongpairoj, Jeffrey B. Remmel. Positional Marked Patterns in Permutations |
| 0 | -- | 0 | Wenjie Fang. Efficient recurrence for the enumeration of permutations with fixed pinnacle set |
| 0 | -- | 0 | Helena Bergold, Winfried Hochstättler, Uwe Mayer. The Neighborhood Polynomial of Chordal Graphs |
| 0 | -- | 0 | SuLin Song, Lan Lei, Yehong Shao, Hong-Jian Lai. Asymptotically sharpening the $s$-Hamiltonian index bound |