| PATH EXTENSIBILITY OF CONNECTED,LOCALLY 2-CONNECTED K_(1,3)-FREE GRAPHS |
| |
| 引用本文： | WANG Jianglu(Department of Mathematics,Shandong Teachers' University,Ji'nan 250014,China)ZHU Yongjin(Institute of Systems Science,Academia Sinica,Beijing 100080,China). PATH EXTENSIBILITY OF CONNECTED,LOCALLY 2-CONNECTED K_(1,3)-FREE GRAPHS[J]. 系统科学与复杂性, 1997, 0(3) |
| |
| 作者姓名： | WANG Jianglu(Department of Mathematics Shandong Teachers' University Ji'nan 250014 China)ZHU Yongjin(Institute of Systems Science Academia Sinica Beijing 100080 China) |
| |
| 作者单位： | WANG Jianglu(Department of Mathematics，Shandong Teachers' University，Ji'nan 250014，China)ZHU Yongjin(Institute of Systems Science，Academia Sinica，Beijing 100080，China) |
| |
| 摘 要： | 1.IntroductionandNotationqInthispaperswewillconsideronlyfinite,undirectedgraphs,withoutloopsandmultipleedges.Weusethenotationsandterminologyin[1].Inaddition,ifGisagraph,wedenotebyV(G)andE(G),respectively,thevertexsetandtheedgesetofG.ForanyaEV(G),ACV(G),BC…
|
PATH EXTENSIBILITY OF CONNECTED, LOCALLY 2-CONNECTED K_(1,3)-FREE GRAPHS |
| |
| WANG Jianglu. PATH EXTENSIBILITY OF CONNECTED, LOCALLY 2-CONNECTED K_(1,3)-FREE GRAPHS[J]. Journal of Systems Science and Complexity, 1997, 0(3) |
| |
| Authors: | WANG Jianglu |
| |
| Abstract: | In this paper, we prove that every connected, locally 2-connected claw-freegraph is path extendable. |
| |
| Keywords: | Claw-free graph locally k-connected path extendable. |
| 本文献已被 CNKI 等数据库收录！ |
|
