摘要
从作者前文《极大平面图的构成算法》中的“极大平面图充分必要条件定理”为基础,经分析研究推论出“极大平面图中任意结点的邻接点必构成圈”。进而提出了“极大平面图同构的充分必要条件定理”并给予证明。最后,归纳出“求任意阶所有的非同构极大平面图的算法”。从而为研究极大平面图的着色问题提供基础。
Based on the “Sufficient and Necessary condition theorem of maximum plain map”de- scribed Based on the paper《Stuctural algorithm of maximum planegraph》,this thesis got the result that“the adjacent connecting points of any node necessarily form a loop”,therefore, presented and proved the “Sufficient and Necessary condition theorem of isomorphism of maximum plain map.At the end,a calculation method of all the non-isomorphic maximum plain map of any exponent was inducted,thus prepared a basis for the study of coloring of maximum plain map.
出处
《北京机械工业学院学报》
1998年第1期18-23,共6页
Journal of Beijing Institute of Machinery
关键词
平面图
极大平面图
同构图
plain map
maximum plain map
isomorphic map
