Hamilton图的充分条件
首发时间:2011-08-19
摘要:本文提出的HAMILTON图的一个充分条件优于Fan-条件,因而是在以下意义下是目前最好的:即所有满足现有充分条件(Dirac,Posa, Bondy,Chvatal,Fan)的HAMILTON图都是满足本文提出的充分条件图的真子集。给出了一个多项式时间算法,判断一个给定图是否满足此充分条件,并在满足充分条件时找到它的一个Hamilton圈。
For information in English, please click here
On Sufficient Condition For Hamilton Graph
Abstract:n this paper a sufficient condition for a graph to be Hamiltonian is given that is better than Fan-condition,thuse it is the best so far in the meaning of that all of the graphs that satisfy the conditions of (Dirac,Ore,Posa, Bondy, Chvatal, and Fan) is the proper subset of the graphs that satisfy the condition given in this paper.
Keywords: Hamilton Graph Alternating path P-chain Normor P-chain
基金:
论文图表:
引用
No.4438720394364131****
同行评议
共计0人参与
勘误表
Hamilton图的充分条件
评论
全部评论0/1000