|
|||||
|
|
| 图的禁用子图和H—连通性 | |
| 引用本文： | 徐新萍.图的禁用子图和H—连通性[J].南京师大学报,1995(4). |
| 作者姓名： | 徐新萍 |
| 作者单位： | 江苏教育学院数学系 |
| 摘 要： | 证明了如下结果：设Ｇ是３—连通图，如果Ｇ满足如下之一：（ｉ）｛Ｋ１，３，Ａ，Ｄ）－ｆｒｅｅ．（ｉｉ）｛Ｋ１，３，Ａ，Ｐ５｝－ｆｒｅｅ．（ｉｉｉ）｛Ｋ１，３，Ｉ｝－ｆｒｅｅ．（ｉｉｉｉ）｛Ｋ１，３，Ｚ３，Ｂ｝－ｆｒｅｅ．则Ｇ是Ｈ－连通的． |
| 关 键 词： | Hamilton－图，H－连通性，禁用子图 |
Forbidden Subgraphs and Hamiltonian-Connected Properties of Graphs |
|
| Xu Xinping.Forbidden Subgraphs and Hamiltonian-Connected Properties of Graphs[J].Journal of Nanjing Normal University(Natural Science Edition),1995(4). | |
| Authors: | Xu Xinping |
| Abstract: | It was proved that:Theorem 1 Let G is a 3 - connected graph, {K1,3,A,D} -free, then G is Hamiltonian - connected.Theorem 2 Let G is a 3 - connected graph, {K1,3,A,P5 } -free, then G is Hamiltonian- connected.Theorem 3 Let G is a 3 - connected graph, {K1,3,I} -free, then G is Hamiltonian-connected.Theorem 4 Let G is a 3 - connected graph, {K1,3,Z3,B} -free, then G is Hamiltonian-connected. |
| Keywords: | Hamiltonian graph Hamiltonian-connected graph forbidden subgraph |
| 本文献已被 CNKI 等数据库收录！ | |