|
|||||
|
|
| 3-连通(X,Y)-free图的Hamiltonian-连通性 | |
| 引用本文： | 徐军. 3-连通(X,Y)-free图的Hamiltonian-连通性[J]. 数学的实践与认识, 2010, 40(24) |
| 作者姓名： | 徐军 |
| 基金项目： | 安徽省教育厅自然科学基金 |
| 摘 要： | 一个图G称为(X,Y)-free图,如果G不含同构于子图X和Y的导出子图.本文证明了X=K_(1,3)、Y∈{D,W,B}的3-连通(X,Y)-free图是Hamiltonian-连通的. |
| 关 键 词： | 无爪图 Hamiltonian-连通图 (X,Y)-free图 |
The Hamiltonian Connectedness in 3-Connected (X,Y)-Free Graphs |
|
| XU Jun. The Hamiltonian Connectedness in 3-Connected (X,Y)-Free Graphs[J]. Mathematics in Practice and Theory, 2010, 40(24) | |
| Authors: | XU Jun |
| Abstract: | A graph is(X,F)-free if it contains no induced subgraph isomorphic to X and Y.If X = K_(1,3) and Y∈{D,W,B},we prove every 3-connected(X,Y)-free graph is the Hamiltonian-connected graph. |
| Keywords: | Claw-free graph Hamiltonian-connected graph (X,Y)-free graph |
| 本文献已被 万方数据 等数据库收录！ | |