star-path and star-stripe bipartite ramsey numbers in multicoloring

For given bipartite graphs g1, g2, . . . , gt, the bipartite ramsey number br(g1, g2, . . . , gt) is the smallest integer n such that if the edges of the complete bipartite graph kn,n are partitioned into t disjoint color classes giving t graphs h1, h2, . . . , ht, then at least one hi has a subgraph isomorphic to gi. in this paper, we study the multicolor bipartite ramsey number br(g1, g2, . . . , gt), in the case that g1, g2, . . . , gt being either stars and stripes or stars and a path.