Spanning trees and spanning Eulerian subgraphs with small degrees. - Morteza Hasanvand (Discret. Math., 2015)

The square chromatic number of the torus. - A. G. Chegini; Morteza Hasanvand; Ebadollah S. Mahmoodian; Farokhlagha Moazami (Discret. Math., 2016)

Highly edge-connected factors using given lists on degrees. - Saieed Akbari; Morteza Hasanvand; Kenta Ozeki (J. Graph Theory, 2019)

Equitable factorizations of edge-connected graphs. - Morteza Hasanvand (Discret. Appl. Math., 2022)

The existence of uniform hypergraphs for which the interpolation property of complete coloring fails. - Nastaran Haghparast; Morteza Hasanvand; Yumiko Ohno (Discret. Math., 2022)

Spanning trees and spanning closed walks with small degrees. - Morteza Hasanvand (Discret. Math., 2022)

The Existence of Planar 4-Connected Essentially 6-Edge-Connected Graphs with No Claw-Decompositions. - Morteza Hasanvand (Graphs Comb., 2023)

Modulo orientations with bounded out-degrees. - Morteza Hasanvand (Discret. Math., 2024)

Modulo factors with bounded degrees. - Morteza Hasanvand (Discret. Math., 2025)