THE ROTATION GRAPHS OF PERFECT MATCHINGS OF PLANE BIPARTITE GRAPHS

In the present paper, the minimal proper alternating cycle (MPAC) rota tion graph R(G) of perfect matchings of a plane bipartite graph G is d efined. We show that an MPAC rotation graph R(G) of G is a directed ro oted tree, and thus extend such a result for generalized polyhex graph s to arbitrary plane bipartite graphs. As an immediate result, we desc ribe a one-to-one correspondence between MPAC systems and perfect matc hings in G.