Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs

DOI10.1142/S1793830914500438zbMath1298.05191arXiv1212.6466OpenAlexW2080784768MaRDI QIDQ2920892

Chen, Bing, Bo Ning, Sheng Gui Zhang

Publication date: 29 September 2014

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

induced subgraphHamilton cycleclaw-free (1-heavy, 2-heavy, \(o\)-heavy) graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

Hamilton cycles in almost distance-hereditary graphs

Cites Work

• Unnamed Item
• Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
• New sufficient conditions for cycles in graphs
• Degree conditions on induced claws
• Hamilton cycles in claw-heavy graphs
• Forbidden subgraphs and Hamiltonian properties and graphs
• Sufficient conditions for a graph to be Hamiltonian
• Pairs of Heavy Subgraphs for Hamiltonicity of 2-Connected Graphs

This page was built for publication: Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs