Degree conditions restricted to induced paths for hamiltonicity of claw-heavy graphs

详细信息    查看全文

• 作者：Bin Long Li ; Bo Ning ; Sheng Gui Zhang
• 关键词：Hamiltonian graph ; forbidden subgraph condition ; degree condition ; claw ; heavy graph ; closure theory
• 刊名：Acta Mathematica Sinica, English Series
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：33
• 期：2
• 页码：301-310
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics, general;
• 出版者：Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
• ISSN：1439-7617
• 卷排序：33

文摘

Broersma and Veldman proved that every 2-connected claw-free and P₆-free graph is hamiltonian. Chen et al. extended this result by proving every 2-connected claw-heavy and P₆-free graph is hamiltonian. On the other hand, Li et al. constructed a class of 2-connected graphs which are claw-heavy and P₆-o-heavy but not hamiltonian. In this paper, we further give some Ore-type degree conditions restricting to induced copies of P₆ of a 2-connected claw-heavy graph that can guarantee the graph to be hamiltonian. This improves some previous related results.