Yaser Rowshan

According to our database, Yaser Rowshan authored at least 9 papers between 2022 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Partitioning of a graph into induced subgraphs not containing prescribed cliques.

Yaser Rowshan, Ali Taherkhani

Discret. Appl. Math., February, 2024

The <i>m</i>-bipartite Ramsey number <i>BR_m(H₁,H₂)</i>.

Yaser Rowshan

Discuss. Math. Graph Theory, 2024

2023

Multipartite Ramsey number of complete graphs versus matchings.

Yaser Rowshan, Mostafa Gholami

Art Discret. Appl. Math., August, 2023

Some bounds on the size of maximum G-free sets in graphs.

Yaser Rowshan

Discret. Math. Algorithms Appl., July, 2023

Nordhaus-Gaddum problem in terms of G-free coloring.

Yaser Rowshan

Discret. Math. Algorithms Appl., May, 2023

The size multipartite Ramsey numbers mj(C3,C3,nK2,mK2).

Yaser Rowshan, Mostafa Gholami

Discret. Math. Algorithms Appl., April, 2023

Multicolor bipartite Ramsey numbers for paths, cycles, and stripes.

Yaser Rowshan, Mostafa Gholami

Comput. Appl. Math., February, 2023

The bipartite Ramsey numbers BR(C₈, C_2n).

Mostafa Gholami, Yaser Rowshan

Discret. Math. Theor. Comput. Sci., 2023

2022

A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs.

Yaser Rowshan, Ali Taherkhani

Discret. Math., 2022