关于无爪Hamilton图的一个泛圈性结果(英文)

A Cycle Theorem for Hamiltonian Graphs without K 1,3 *

一个图Ｇ是泛圈的，如果它含有长为３，４，…，ｎ（＝｜Ｖ（Ｇ）｜）的圈．本文探讨了一类无爪Ｈａｍｉｌｔｏｎ图的圈结构，主要结果为：设Ｇ＝（Ｖ，Ｅ）是ｎ阶无爪Ｈａｍｉｌｔｏｎ图．如果Ｇ中有节点ｘ使ｄ（ｘ）ｎ／２且Ｎ（ｘ）连通，则除少数几个例外，Ｇ是泛圈的．

Let G=(V, E) be a hamiltonian K 1.3 free graph such that d(x) |V| 2 and G is connected for some vertex x of G . Then G is pancyclic with a few number of exceptions.