山西大学学报（自然科学版）2005，Vol.28Issue(2)：133-135,3.
含有两个分离三角形的极大平图有一个Hamilton路
Any Maximal Planar Graph with Two Separating Triangles Has a Hamilton Path
摘要
Abstract
A graph is hamiltonian if it has a hamiltonian cycle. A classical theorem of Whitney indicates that any maximal planar graph with no separatining triangles is hamiltonian. Where a separating triangle is a triangle that removal separates the graph. Chuiyuan Chen proved that any maximal planar graph with only one separating triangle is still hamiltonian. It's proved that any maximal planar graph with two separating triangles has a hamiltonian path.关键词
极大平图/分离三角形/Hamilton圈/Hamilton路Key words
maximal planar graph/hamiltoian cycle/hamiltonian path/separaing triangle分类
数理科学引用本文复制引用
李丽萍,李瑞娟,李胜家..含有两个分离三角形的极大平图有一个Hamilton路[J].山西大学学报（自然科学版）,2005,28(2):133-135,3.基金项目
NSFC(60174007) （60174007）
Shanxi provincial natural science foundation (20011001) （20011001）
