- Xiaodan Chen, Xiaoning Yang. An upper bound on path cover number of regular graphs and its application to Hamiltonian cycle in tough graphs. Discrete Applied Mathematics, 383:113-121, 2026.
- Sagi Snir, Raphael Yuster. Simultaneous separation in bounded degree trees. Discrete Applied Mathematics, 387:160-171, 2026.
- Mengfan Chen, Liqiong Xu. On maximally edge-connectivity of squares of graphs. Discrete Applied Mathematics, 388:102-107, 2026.
- Zixuan Yang, Hongliang Lu, Baoyindureng Wu, Shenggui Zhang. Regular graphs with equal weakly connected domination number and matching number. Discrete Applied Mathematics, 388:43-55, 2026.
- Hui Gao. Covering a supermodular-like function in a mixed hypergraph. Discrete Applied Mathematics, 385:72-76, 2026.
- Sylvain Gravier, Matthieu Petiteau, Isabelle Sivignon. Note about the complexity of the acyclic orientation with parity constraint problem. Discrete Applied Mathematics, 389:83-91, 2026.
- Milica Andelic, Zoran Stanic, Fernando C. Tura. Interlacing properties of Laplacian eigenvalues of chain graphs. Discrete Applied Mathematics, 380:80-88, 2026.
- Lu Wang, Liming Xiong. Hamilton-connected claw-free graphs with small parameters. Discrete Applied Mathematics, 379:35-44, 2026.
- Fariha Iftikhar, Gábor P. Nagy. The random generation of Latin rectangles based on the assignment problem. Discrete Applied Mathematics, 378:329-336, 2026.
- Vishwanath R. Singireddy, Manjanna Basappa, Joseph S. B. Mitchell. Algorithms for k -dispersion for points in convex position in the plane. Discrete Applied Mathematics, 386:205-216, 2026.