Implicit degree condition restricted to essential independent sets for Hamiltonian cycles

DOI10.1007/s13226-023-00418-xMaRDI QIDQ6669289

Xing Huang

Publication date: 22 January 2025

Published in: Indian Journal of Pure \& Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

Hamiltonian cycleimplicit degreeessential independent set

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• An implicit degree condition for Hamiltonian graphs
• New sufficient conditions for cycles in graphs
• An improved degree based condition for Hamiltonian cycles
• Implicit-degrees and circumferences
• A comprehensive analysis of degree based condition for Hamiltonian cycles
• On Hamiltonian cycles and Hamiltonian paths
• An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
• A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
• New sufficient condition for Hamiltonian graphs
• Large cycles in graphs
• A note on Hamiltonian circuits
• An Implicit Degree Condition for Cyclability in Graphs
• Note on Hamilton Circuits
• A note on the Song–Zhang theorem for Hamiltonian graphs
• Essential independent sets and Hamiltonian cycles
• Some Theorems on Abstract Graphs

This page was built for publication: Implicit degree condition restricted to essential independent sets for Hamiltonian cycles