关于2-连通图哈密顿路的Lindquester猜测

Lindquester's Conjecture on Hamiltonian Paths of 2-connected Graphs

本文证明了Lindquester猜测:设G是顶点数为n的2-连通图,如果对于G中任一对顶点u,v,距离d(u,v)=2|N(u)U N(v)|≥(n-1)/2,则G有哈密顿路。

This paper proves that Lindquester's conjecture: let G be a 2-coanected graph of order n, and u and v be distinct vertices of G, if dist(u, v)=2■|N(u) ∪N(v)|≥(n-1)/2, then G has hamiltonian path.