A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs

DOI10.1007/s10255-020-0956-xzbMath1462.05204OpenAlexW3081656921MaRDI QIDQ2023732

Lin Wang, Jun-qing Cai

Publication date: 3 May 2021

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-020-0956-x

zbMATH Keywords

Hamiltonian cyclecyclabilityimplicit degree

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• An implicit degree condition for relative length of long paths and cycles in graphs
• An implicit degree Ore-condition for pancyclicity of graphs
• An implicit degree condition for Hamiltonian graphs
• An implicit weighted degree condition for heavy cycles
• Clique-perfectness of claw-free planar graphs
• New sufficient conditions for cycles in graphs
• Implicit-degrees and circumferences
• An implicit degree condition for long cycles in 2-connected graphs
• Fan-type condition on disjoint cycles in a graph
• Cycles through prescribed vertices with large degree sum
• Longest cycles in 4-connected graphs
• A note on a generalisation of Ore's condition
• Large cycles in graphs
• A note on Hamiltonian circuits
• Hamilton cycles in implicit 2-heavy graphs
• Clique-coloring claw-free graphs
• An Implicit Degree Condition for Cyclability in Graphs
• Note on Hamilton Circuits
• 2‐neighborhoods and hamiltonian conditions