HAMILTONICITY IN 2-CONNECTED {K_(1,3) F}-FREE GRAPHS  

作　　者：LI Guojun LIU Zhenhong 

机构地区：[1]Mathematics Depertment of Yantai Teacher’s College,Yantai 264000,China [2]Institute of Systems Science,Academic Sinica,Beijing 100080,China

出　　处：《Systems Science and Mathematical Sciences》1996年第4期295-305,共11页

基　　金：This research is supported by the National Natural Science Foundation of China.

摘　　要：Let F be a graph consisting of a triangle with a pendant leaf dangling from each vertex.A graph is{K_(1,3),F}-free if it contains no induced subgraph isomorphic to K_(1,3)or F.We give a stronger structural characterisation of{K_(1,3),F}-free graph with which we obtain a more general result than that in[1]as follows:Given any two venices in a 2-connected{K_(1,3),F}-free graph,if there exists a shortest path between them containing no 2-cutset of the graph,then the graph has a Hamilton path cormecting these two venices.

关 键 词：{K_(1 3) F}-free graph Hamilton connected vertex dominating cycle. 

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