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) 

出　　处：《Systems Science and Mathematical Sciences》1997年第3期267-274,共8页

摘　　要：In this paper, we prove that every connected, locally 2-connected claw-freegraph is path extendable.In this paper, we prove that every connected, locally 2-connected claw-freegraph is path extendable.

关 键 词：CLAW-FREE graph LOCALLY k-connected PATH extendable. 

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