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


Claw‐free 3‐connected P11‐free graphs are hamiltonian
Authors:Tomasz &#x;uczak  Florian Pfender
Institution:Tomasz ?uczak,Florian Pfender
Abstract:We show that every 3‐connected claw‐free graph which contains no induced copy of P11 is hamiltonian. Since there exist non‐hamiltonian 3‐connected claw‐free graphs without induced copies of P12 this result is, in a way, best possible. © 2004 Wiley Periodicals, Inc. J Graph Theory 47: 111–121, 2004
Keywords:Hamilton cycle  claw‐free graphs  forbidden subgraphs
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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