关于三角剖分图的2个结果  

Two results on the triangulation

作　　者：李丽萍[1] 谢秀峰[1] 张海霞[1] 

机构地区：[1]太原科技大学应用科学学院,山西太原030024

出　　处：《纺织高校基础科学学报》2011年第4期554-556,共3页Basic Sciences Journal of Textile Universities

摘　　要：研究了含有1个或2个分离三角形的三角剖分图.得到了仅含有1个分离三角形且至多有7个边界点的三角剖分图,有一条Hamilton路.还得到了含有2个分离三角形的极大平图,当2个分离三角形有公共边时,此极大平图是Hamilton图.The triangulation that contains one or two separation triangles is researched in this paper.The first result is that a triangulation with only one separating triangle and at most seven boundary vertices has a Hamiltonian path.The other result of this paper is that a maximal planar graph with two separating triangles is Hamiltonian when two separating triangles has a common edge.

关 键 词：三角剖分图 分离三角形 HAMILTON图 

分 类 号：O157[理学—数学]