3-连通[6,2]-图中的Hamilton路

The Existence of Hamilton Path in 3-Connected [6,2] Graphs

如果G中任意s个点的导出子图中至少含有t条边,则称图G为[s,t]-图.本文证明了若G是3-连通[6,2]-图,则G或者含有Hamilton路或者同构于K-5∨G3.其中,G3是含有3个点的任意图.

A graph G is a [ s, t ] -graph, if there are at least t edges in every included subgraph of any s vertices. We prove that a graph G has Hamilton path or is isomorphic to K5∨G3 （ G3 is an arbitrary graph containing 3 vertices） if G is a 3-connected [6,2]-raph.