Pairs of heavy subgraphs for hamiltonicity of 2-connected graphs

Binlong Li, Zdeněk Ryjáček, Ying Wang, Shenggui Zhang

科研成果: 期刊稿件文章同行评审

17 引用 (Scopus)

摘要

Let G be a graph on n vertices. An induced subgraph H of G is called heavy if there exist two nonadjacent vertices in H with degree sum at least n in G. We say that G is H-heavy if every induced subgraph of G isomorphic to H is heavy. For a family H of graphs, G is called H-heavy if G is H-heavy for every H ∈ H. In this paper we characterize all connected graphs R and S other than P 3 (the path on three vertices) such that every 2-connected {R, S}-heavy graph is Hamiltonian. This extends several previous results on forbidden subgraph conditions for Hamiltonian graphs.

源语言英语
页(从-至)1088-1103
页数16
期刊SIAM Journal on Discrete Mathematics
26
3
DOI
出版状态已出版 - 2012

指纹

探究 'Pairs of heavy subgraphs for hamiltonicity of 2-connected graphs' 的科研主题。它们共同构成独一无二的指纹。

引用此