| HAMILTONICITY IN 2-CONNECTED {K_(1,3) F}-FREE GRAPHS |
| |
| 引用本文： | LI Guojun(Mathematics Depertment of Yantai Teacher's College,Yantai 264000,China)LIU Zhenhong(Institute of Systems Science,Academic Sinica,Beijing 100080,China). HAMILTONICITY IN 2-CONNECTED {K_(1,3) F}-FREE GRAPHS[J]. 系统科学与复杂性, 1996, 0(4) |
| |
| 作者姓名： | LI Guojun(Mathematics Depertment of Yantai Teacher's College Yantai 264000 China)LIU Zhenhong(Institute of Systems Science Academic Sinica Beijing 100080 China) |
| |
| 作者单位： | LI Guojun(Mathematics Depertment of Yantai Teacher's College，Yantai 264000，China)LIU Zhenhong(Institute of Systems Science，Academic Sinica，Beijing 100080，China) |
| |
| 摘 要： | ＨＡＭＩＬＴＯＮＩＣＩＴＹＩＮ２－ＣＯＮＮＥＣＴＥＤ｛Ｋ_（１，３）Ｆ｝－ＦＲＥＥＧＲＡＰＨＳ￥ＬＩＧｕｏｊｕｎ（ＭａｔｈｅｍａｔｉｃｓＤｅｐｅｒｔｍｅｎｔｏｆＹａｎｔａｉＴｅａｃｈｅｒ＇ｓＣｏｌｌｅｇｅ，Ｙａｎｔａｉ２６４０００，Ｃｈｉｎａ）ＬＩＵ?..
|
HAMILTONICITY IN 2-CONNECTED {K_(1,3) F}-FREE GRAPHS |
| |
| LI Guojun. HAMILTONICITY IN 2-CONNECTED {K_(1,3) F}-FREE GRAPHS[J]. Journal of Systems Science and Complexity, 1996, 0(4) |
| |
| Authors: | LI Guojun |
| |
| Abstract: | Let F be a graph consisting of a triangle with a pendant leaf dangling from each vertex. A graph is {K1,3, F}-free if it contains no induced subgraph isomorphic to K1,3 or F. We give a stronger structural characterisation of {K1,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 {K1,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. |
| |
| Keywords: | K1 3 F}-free graph Hamilton connected vertex dominating cycle. |
| 本文献已被 CNKI 等数据库收录！ |
|
