• Citations Per Year
Learn More
Let G be a plane bipartite graph. The Z-transformation graph Z(G) and its orientation Z̃(G) on the maximum matchings of G are de1ned. If G has a perfect matching, Z(G) and Z̃(G) are the usual Z-transformation graph and digraph. If G has neither isolated vertices nor perfect matching, then Z(G) is not connected. This paper mainly shows that some basic(More)
  • 1