The following pages link to Yaser Rowshan (Q2142649):
Displaying 9 items.
- A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs (Q2142650) (← links)
- Multicolor bipartite Ramsey numbers for paths, cycles, and stripes (Q2685284) (← links)
- Multipartite Ramsey number of complete graphs versus matchings (Q6065314) (← links)
- (Q6071580) (← links)
- The size multipartite Ramsey numbers mj(C3,C3,nK2,mK2) (Q6132247) (← links)
- Nordhaus–Gaddum problem in terms of G-free coloring (Q6132869) (← links)
- Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)
- The bipartite Ramsey numbers $BR(C_8, C_{2n})$ (Q6507611) (← links)
