|
|||||
|
|
Every 3-connected {K1,3,Z7}-free graph of order at least 21 is Hamilton-connected |
|
| Authors: | Zdeněk Ryjáček Petr Vrána |
| Abstract: | |
| Keywords: | Hamilton-connected Closure Forbidden subgraph Claw-free |
| 本文献已被 ScienceDirect 等数据库收录！ | |
|
||||||||||||||||
|
||||||||||||||||
|
||||||||||||||||
|
|
|
|
| 设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
|
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |