TWO NEW SUFFICIENT CONDITIONS FOR HAMILTON-CONNECTED GRAPHS  

作　　者：吴正声 

出　　处：《Acta Mathematicae Applicatae Sinica》1995年第1期44-50,共7页应用数学学报（英文版）

摘　　要：Let G be a 3-connected graph with n vertices, is an independent set of G} , MC(G)=min is an independent set in G}.In this paper, the main results are as follows.TheoremⅠ. If then G is Hamilton-connected.TheoremⅡ. If, then G is Hamilton-connected.Theorems I and IIare the best possible, and are incomparable in the sense that neither theorem implies the other.Let G be a 3-connected graph with n vertices, is an independent set of G} , MC(G)=min is an independent set in G}.In this paper, the main results are as follows.TheoremⅠ. If then G is Hamilton-connected.TheoremⅡ. If, then G is Hamilton-connected.Theorems I and IIare the best possible, and are incomparable in the sense that neither theorem implies the other.

关 键 词：connected graph HAMILTON-CONNECTED 

分 类 号：O157.5[理学—数学]