摘要
设G为k正则的2连通的不含K_(1.3)的图,则(ⅰ) c(G)≥min{|V(G)|,4k-2},且是最好可能的;(ⅱ)当|V(G)|≤5k-3时,G是哈密顿的。
Let G be a k-regular 2-connected K1.3 -free graph, it is proved that.(1) c(G)≥min{|V(G)|, 4k-2} and is best possible;(2) If |F(G)|≤5k-3, then G is a hamiltonian.
关键词
连通图
k正则
2连通
周长
哈密顿
connected graph, k-regular, 2-connected, K1.3-frec, circumference, hamiltonian.
