首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Hamiltonian Connectedness in Claw-Free Graphs
Authors:Xiaodong Chen  Mingchu Li  Xin Ma  Xinxin Fan
Institution:1. School of Software, Dalian University of Technology, Dalian, 116620, People’s Republic of China
2. Department of mathematics of Shenyang Jianzhu, University Urban Construction College, Shenyang, 110167, People’s Republic of China
Abstract:If every vertex cut of a graph G contains a locally 2-connected vertex, then G is quasilocally 2-connected. In this paper, we prove that every connected quasilocally 2-connected claw-free graph is Hamilton-connected.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号