论文部分内容阅读
在本文中,我们给出了下列定理:设G是阶为n≥3的连通K_(13)—Free图且NC(G)≥n—δ—2。则G是可遍历的。
In this paper, we give the following theorem: Let G be a connected K_ (13) -Free graph of order n≥3 and NC (G) ≥n-δ-2. G is traversable.