PANCONNECTIVITY ON 2-CONNECTED CLAW-FREE GRAPHS  

作　　者：高敬振 朱永津 

机构地区：[1]Institute of Systems Science, Academia Sinica, Beijing 100080, PRC

出　　处：《Chinese Science Bulletin》1992年第3期253-254,共2页

摘　　要：A graph G is called claw-flee if G contains no induced subgraph isomorphic to K_1,3,Line graphs, an important class of graphs, are claw-free graphs. Existing results indicate that in comparison with graphs in general, claw-free graphs possess much better properties. For Hamiltonian properties of claw-free graphs, the following results are interesting.

关 键 词：SUBGRAPH ISOMORPHIC HAMILTONIAN VERTEX moreover stronger 

分 类 号：N[自然科学总论]