期刊文献+

Four Forbidden Subgraph Pairs for Hamiltonicity of 3-connected Graphs

Four Forbidden Subgraph Pairs for Hamiltonicity of 3-connected Graphs
原文传递
导出
摘要 For non-negative integers i,j and k, we denote the generalized net as Ni,j,k, which is a triangle with disjoint paths of length i, j and k, attached to distinct vertices of the triangle. In this paper, we prove that every 3-connected {K1,3,N8-i,i,1}-free graph is hamiltonian, where 1〈i〈4. For non-negative integers i,j and k, we denote the generalized net as Ni,j,k, which is a triangle with disjoint paths of length i, j and k, attached to distinct vertices of the triangle. In this paper, we prove that every 3-connected {K1,3,N8-i,i,1}-free graph is hamiltonian, where 1〈i〈4.
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2016年第2期469-476,共8页 应用数学学报(英文版)
基金 Supported by the National Natural Science Foundation of China(No.11371162 and No.11271149) A project of Shandong Province Higher Educational Science and Technology Program(No.J15LI52) Science and Technology Development Project of Shandong Province(No.2014GGX101033)
关键词 hamiltonian cycle forbidden subgraphs claw-free graphs CLOSURE hamiltonian cycle forbidden subgraphs claw-free graphs closure
  • 相关文献

参考文献1

二级参考文献1

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部