2-Bipartite Matching Extendability of C_n×P_2

Let G be a connected graph containing a perfect matching.G is said to be bipartite matching extendable if every matching M of G whose induced subgraph is a bipartite matching extends to a perfect matching of G. To further study the bipartite matching extendable graphs,we consider the bipartite matching number of G,denoted by BM (G) ,is the number of edges of a maximum bipartite matching of G. In this paper we prove that Cn×P2 is 2-Bipartite matching extendable.