摘要
本文定义了一类由给定的一个３－正则平面偶图的全体完美匹配所构成的变换图，并证明了该变换图是连通的．由此可得出结论：从任一给定的３－正则平面偶图的完美匹配出发，通过一种所谓的旋转运算，就可以生成全部其它的完美匹配．
A type of transformation graph defined on the perfect matchings of a given 3--regular Planar bipartitegraph is introduce in this Paper,and it is shown that these transformation graphs are connected. Hence we conclude that from any given perfect matching of a 3-regular planar bipartite graph we can get all other perfect matchings of it by using a kind of so called Z-transformation.
出处
《数学研究》
CSCD
1996年第2期76-80,共5页
Journal of Mathematical Study
