| 1 | -- | 0 | Watcharintorn Ruksasakchai, Pongpat Sittitrai. Sufficient Conditions make Graphs Edge DP-$\varDelta $-Colorable |
| 2 | -- | 0 | Hortensia Galeana-Sánchez, Carlos Vilchis-Alfaro. Dynamic Cycles in Edge-Colored Multigraphs |
| 3 | -- | 0 | Yian Xu. 5-e)-Free Graphs are 5-Colorable |
| 4 | -- | 0 | Ameera Vaheeda Shanavas, Manoj Changat, Peter F. Stadler. On the Cut-Vertex and the Interval Transit Functions of Hypergraphs |
| 5 | -- | 0 | Viswanathan B. N, Douglas B. West. Hamiltonian Cycles and Tight Cutsets |
| 6 | -- | 0 | Seog-Jin Kim, Sang June Lee, Xiaopan Lian, Xuding Zhu. List Dynamic 4-Coloring of Planar Graphs |
| 7 | -- | 0 | Deping Song, Shuang Li, Xiao Wang. On Fan's Conjecture About 4-Flow |
| 8 | -- | 0 | Mingyuan Ma, Han Ren. The p-Arboricity of Outerplanar Graphs |
| 9 | -- | 0 | Xiaoli Yuan, Yuejian Peng. On Generalized Turán Numbers of Intersecting Cliques |
| 10 | -- | 0 | Toru Hasunuma. Connectivity Preserving Hamiltonian Cycles in k-Connected Dirac Graphs |
| 11 | -- | 0 | Wangyi Shang, Shenggui Zhang, Binlong Li, Xia Liu. Local Degree Conditions for Hamiltonicity of Claw-Free Graphs |
| 12 | -- | 0 | Yi Wang, Peixue Zhao, Fei Huang. Rainbow Pancyclicity and Panconnectivity of Strongly Edge-Colored Graphs |
| 13 | -- | 0 | Darine Al-Mniny, Salman Ghazal. Secant edges: a tool for Cohen et al.'s conjectures about subdivisions of oriented cycles and bispindles in Hamiltonian digraphs with large chromatic number |
| 14 | -- | 0 | Qiqi Huang, Weihua He, Chaoqin Zhang. Graphs with Positive Ricci Curvature |
| 15 | -- | 0 | José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia. Ortho-Unit Polygons can be Guarded with at most $\left\lfloor \frac{n-4}{8} \right\rfloor $ Guards |
| 16 | -- | 0 | Naivedya Amarnani, Amaury De Burgos, Wayne Broughton. Correction: Packing and Covering Triangles in Bilaterally-Complete Tripartite Graphs |
| 17 | -- | 0 | Junyao Pan, Pengfei Guo. On the Permutations that Strongly Avoid the Pattern 312 or 231 |
| 18 | -- | 0 | Nguyen Thu Hang, Thanh Vu. Projective dimension and regularity of 3-path ideals of unicyclic graphs |
| 19 | -- | 0 | Richard A. Brualdi, Lei Cao, John L. Goldwasser. 12... t-Permutation Avoiding (0, 1)-Matrices |
| 20 | -- | 0 | Michael C. Wigal, Xingxing Yu. On Tutte Cycles Containing Three Prescribed Edges |
| 21 | -- | 0 | Yanwei Zhao, Shenglin Zhou. Block-Transitive 2-(v,5,λ ) Designs Admitting Automorphism Groups $S_{c} \wr S_d$ |
| 22 | -- | 0 | Chengfu Qin, Jin Geng, Hailing Yang, Xiaoqing Xie. Contractible Edges in Spanning Trees of 3-Connected Graphs |
| 23 | -- | 0 | Sanchita Paul. On Some Subclasses of Oriented Catch Digraphs |
| 24 | -- | 0 | Yongke Qu, Yuanlin Li, Qinghong Wang, Xiaoyue Zhao. A Note on Additive Bases of Abelian Groups of Rank 2 |
| 25 | -- | 0 | Paul Becker, Thomas R. Cameron, Derek Hanely, Boon Ong, Joseph P. Previte. On the Number of Minimal Forts of a Graph |
| 26 | -- | 0 | Pierre Ille, Soufiane Lakhlifi. When a Decomposable Tournament is -1,3-Reconstructible? |
| 27 | -- | 0 | David James, Elisha Kahan, Erik Rauer. * |
| 28 | -- | 0 | Rui Li, Jinfeng Li, Di Wu. Optimal Chromatic Bound for ($P_3\cup P_2$, House)-Free Graphs |
| 29 | -- | 0 | Qiming Hu, Baogang Xu. Maximum Bisections of Graphs Without Adjacent Quadrilaterals |
| 30 | -- | 0 | Meng Liu, Bangwei Du. Ramsey Numbers of Complete Bipartite Graphs |
| 31 | -- | 0 | Wenjuan Zhou, Rong-Xia Hao, Zhen He, Jaeun Lee. An infinite family of snarks with perfect matching cover index 4 |
| 32 | -- | 0 | Ummul Aymen, James Della-Giustina, Lindsey-Kay Lauderdale, Jason Riley, Erin Stales, Jay Zimmerman. On the Fixing Sets of Finite Groups |
| 33 | -- | 0 | Hoi Ping Luk, Min Yan. Angle Combinations in Tilings of the Sphere by Angle Congruent Pentagons |
| 34 | -- | 0 | Mathilde Bouvel, Luca S. Ferrari, Bridget Eileen Tenner. Between Weak and Bruhat: The Middle Order on Permutations |
| 35 | -- | 0 | Haruko Okamura. 2-Reducible Two Paths and Two Edges Constructing a Cycle in (2k+1)-Edge-Connected Graphs |