关于图是可迹或1-哈密尔顿的两个充分条件(英文)

Two Sufficient Conditions for Graphs to Be Traceable or 1-Hamiltonian

设 G是一个图 ,G的独立集 Y称为本质集 ,如果存在 { y1 ,y2 } Y,使得 dist( y1 ,y2 ) =2 .利用插点方法 ,给出了关于 ( k-1 )或 ( k+ 1 ) -连通 ( k≥ 2 )图 G是可迹的或 1 -哈密尔顿的统一证明 .

Let G be a graph. An independent set Y in G is called an essential set if there is {y 1,y 2}Y such that dist (y 1,y 2) =2. In this paper, we will use the technique of the vertex insertion on l -connected ( l=k-1 or k+1, k≥2 ) graphs to provide a unified proof for G to be traceable or 1-Hamiltonian.