ON IMPLICIT HEAVY SUBGRAPHS AND HAMILTONICITY OF 2-CONNECTED GRAPHS

被引：0
|
作者：
Zheng, Wei [1 ]
Widel, Wojciech [2 ]
Wang, Ligong [1 ]
机构：
[1] Northwestern Polytech Univ, Dept Appl Math, Sch Sci, Xian 710072, Shaanxi, Peoples R China
[2] Univ Rennes, IRISA, CNRS, INSA Rennes, Rennes, France
来源：
DISCUSSIONES MATHEMATICAE GRAPH THEORY | 2021年 / 41卷 / 01期
基金：
中国国家自然科学基金;
关键词：
implicit degree; implicit o-heavy; implicit f-heavy; implicit c-heavy; Hamilton cycle; FORBIDDEN PAIRS; CYCLES; TRIPLES;
D O I：
10.7151/dmgt.2170
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A graph G of order n is implicit claw-heavy if in every induced copy of K-1,K-3 in G there are two non-adjacent vertices with sum of their implicit degrees at least n. We study various implicit degree conditions (including, but not limiting to, Ore- and Fan-type conditions) imposing of which on specific induced subgraphs of a 2-connected implicit claw-heavy graph ensures its Hamiltonicity. In particular, we improve a recent result of [X. Huang, Implicit degree condition for Hamiltonicity of 2-heavy graphs, Discrete Appl. Math. 219 (2017) 126-131] and complete the characterizations of pairs of o-heavy and f-heavy subgraphs for Hamiltonicity of 2-connected graphs.
引用
收藏
页码：167 / 181
页数：15
相关论文
共 50 条
12345