Hamiltonian cycles in 3‐tough 2K2‐free graphs
Hamiltonian cycles in 3‐tough 2K2‐free graphs
复制标题
DOI：
10.1002/jgt.22526
复制
发表时间：
2017-06
影响因子：
0.9
通讯作者：
Songling Shan
中科院分区：
文献类型：
--
作者：
Songling Shan
如果一个图不包含两个独立的边作为诱导子图，则称为2k2自由图。Broersma， Patel和Pyatkin证明了每一个至少有三个顶点的25 - tough 2k 2 - free图是哈密顿图。在本文中，我们将该结果所需的韧性从25提高到3。
A graph is called 2 K 2 ‐free if it does not contain two independent edges as an induced subgraph. Broersma, Patel, and Pyatkin showed that every 25‐tough 2 K 2 ‐free graph with at least three vertices is Hamiltonian. In this paper, we improve the required toughness in this result from 25 to 3.