B. Alspach, “Problem 89,” Discrete Mathematics, Vol. 69, 1988, p. 106.

has been cited by the following article:

• TITLE: Rainbow Matchings in Properly Colored Bipartite Graphs

  AUTHORS: Guanghui Wang, Guizhen Liu

  KEYWORDS: Rainbow Matching; Bipartite Graphs

  JOURNAL NAME: Open Journal of Discrete Mathematics, Vol.2 No.2, April 27, 2012

  ABSTRACT: Let G be a properly colored bipartite graph. A rainbow matching of G is such a matching in which no two edges have the same color. Let G be a properly colored bipartite graph with bipartition (X,Y) and . We show that if , then G has a rainbow coloring of size at least .