Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs

DOI10.1016/J.DISC.2013.04.023zbMath1277.05103arXiv1203.3915OpenAlexW2018834694MaRDI QIDQ383688

Sheng Gui Zhang, Bo Ning

Publication date: 5 December 2013

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

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

zbMATH Keywords

induced subgraphsHamiltonicity\(f\)-heavy subgraphs\(o\)-heavy subgraphs

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (12)

Heavy subgraphs, stability and Hamiltonicity ⋮ Solution to a problem on Hamiltonicity of graphs under Ore- and Fan-type heavy subgraph conditions ⋮ Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs ⋮ Hamilton cycles in almost distance-hereditary graphs ⋮ Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs ⋮ Extremal problems on the Hamiltonicity of claw-free graphs ⋮ A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs ⋮ On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs ⋮ Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity ⋮ Degree conditions restricted to induced paths for Hamiltonicity of claw-heavy graphs ⋮ A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs ⋮ Fan's condition on induced subgraphs for circumference and pancyclicity

Cites Work

• Unnamed Item
• Unnamed Item
• Heavy subgraph conditions for longest cycles to be heavy in graphs
• New sufficient conditions for cycles in graphs
• Characterizing forbidden pairs for hamiltonian properties
• A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
• A note on Hamiltonian circuits
• Note on Hamilton Circuits
• Hamiltonian results inK1,3-free graphs
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs
• Degree-light-free graphs and Hamiltonian cycles

This page was built for publication: Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs