论文部分内容阅读
Let a,b and k be nonnegative integers with a ≥ 2 and b ≥ a(k + 1) + 2.A graph G is called a k-Hamiltonian graph if after deleting any k vertices of G the remaining graph of G has a Hamiltonian cycle.A graph G is said to have a k-Hamiltonian [a,b]-factor if after deleting any k vertices of G the remaining graph of G admits a Hamiltonian [a,b]-factor.Let G is a k-Hamiltonian graph of order n with n ≥ a + k + 2.In this paper,it is proved that G contains a k-Hamiltonian [a,b]-factor if δ(G) ≥ a + k and δ(G) ≥ I(G) ≥ a-1 + a(k+1)/b-2.