Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs

DOI10.1137/11084786XzbMath1256.05052arXiv1109.4122MaRDI QIDQ4899047

Ying Wang, Zdeněk Ryjáček, Sheng Gui Zhang, Bin Long Li

Publication date: 4 January 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1109.4122

zbMATH Keywords

Hamilton cycleforbidden subgraphheavy subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items (17)

Heavy subgraphs, stability and Hamiltonicity ⋮ Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions ⋮ Hamilton cycles in almost distance-hereditary graphs ⋮ Clique-heavy subgraphs and pancyclicity of 2-connected graphs ⋮ Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs ⋮ Extremal problems on the Hamiltonicity of claw-free graphs ⋮ Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles ⋮ Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs ⋮ Conditions for graphs to be path partition optimal ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity ⋮ Heavy subgraph pairs for traceability of block-chains ⋮ Implicit degree condition for Hamiltonicity of 2-heavy graphs ⋮ Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs ⋮ On traceability of claw-\({o_{-1}}\)-heavy graphs ⋮ Characterizing heavy subgraph pairs for pancyclicity ⋮ Forbidden subgraphs for longest cycles to contain vertices with large degrees

This page was built for publication: Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs