最小度不小于3的[s,t]-图的可迹性  

The Traceability of a [s,t]-Graph of Minimum Degree No Less than 3

作　　者：王文彬[1] 王江鲁[1] 

机构地区：[1]山东师范大学数学科学学院,山东济南250014

出　　处：《山东科学》2009年第6期6-8,共3页Shandong Science

摘　　要：如果G中任意s个点的导出子图中至少有t条边,则称G为[s,t]-图.本文证明了:若G为最小度不小于3的2-连通[6,3]-图,则G有Hamilton路或G同构于■∨G3.A graph G is a [s,t]-graph if there are at least t edges in every included sub-graph of any s vertices. This paper proves that a graph G has a Hamilton path or if G is a Hamilton path or G=K5 ∨G3 if G is a δ≥3,2-connected [6,3]-graph.

关 键 词：[s t]-图 最小度 HAMILTON路 

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