2-连通[4,1]-图的Hamilton圈

Hamilton cycles of 2-connected [4,1]-graphs

如果G的任意s个点的导出子图中至少含有t条边,则称图G为[s,t]-图。本文证明了以下结果:2-连通[4,1]-图是Hamilton图的充要条件是它不同构于三类特殊的图。

A graph G is a [ s, t ]-graph if there are at least t edges in every included subgraph of s vertices. This paper proves that the sufficient and necessary condition of a 2-connected [ 4,1 ] -graph to be a Hamilton cycle is that it is not isomorphic to three kinds of specific graphs.