Rainbow Matchings in Properly Colored Bipartite Graphs 外文参考文献.docVIP

Open Journal of Discrete Mathematics, 2012, 2, 62-64 /10.4236/ojdm.2012.22011 Published Online April 2012 (http://www.SciRP.org/journal/ojdm) Rainbow Matchings in Properly Colored Bipartite Graphs Guanghui Wang, Guizhen Liu School of Mathematics, Shandong University, Jinan, China Email: {ghwang, gzliu}@ Received January 19, 2012; revised February 16, 2012; accepted March 25, 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 )