A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs. - Yaser Rowshan; Ali Taherkhani (Discret. Math., 2022)

The bipartite Ramsey numbers BR(C8, C2n). - Mostafa Gholami; Yaser Rowshan (Discret. Math. Theor. Comput. Sci., 2023)

Multicolor bipartite Ramsey numbers for paths, cycles, and stripes. - Yaser Rowshan; Mostafa Gholami (Comput. Appl. Math., 2023)

The size multipartite Ramsey numbers mj(C3,C3,nK2,mK2). - Yaser Rowshan; Mostafa Gholami (Discret. Math. Algorithms Appl., 2023)

Nordhaus-Gaddum problem in terms of G-free coloring. - Yaser Rowshan (Discret. Math. Algorithms Appl., 2023)

Some bounds on the size of maximum G-free sets in graphs. - Yaser Rowshan (Discret. Math. Algorithms Appl., 2023)

Multipartite Ramsey number of complete graphs versus matchings. - Yaser Rowshan; Mostafa Gholami (Art Discret. Appl. Math., 2023)

The m-bipartite Ramsey number BRm(H1,H2). - Yaser Rowshan (Discuss. Math. Graph Theory, 2024)

Partitioning of a graph into induced subgraphs not containing prescribed cliques. - Yaser Rowshan; Ali Taherkhani (Discret. Appl. Math., 2024)