On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
From MaRDI portal
Publication:456147
DOI10.1016/j.ipl.2012.07.014zbMath1248.05110OpenAlexW2057381067MaRDI QIDQ456147
Hsun Su, Yuan-Kang Shih, Shin-Shin Kao
Publication date: 23 October 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2012.07.014
Related Items (1)
Cites Work
- Unnamed Item
- A fan-type result on \(k\)-ordered graphs
- A new sufficient condition for hamiltonicity of graphs
- An improved degree based condition for Hamiltonian cycles
- Removable matchings and Hamiltonian cycles
- A comprehensive analysis of degree based condition for Hamiltonian cycles
- On Hamiltonian cycles and Hamiltonian paths
- A degree characterisation of pancyclicity
- Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
- Advances on the Hamiltonian problem -- a survey
- Degree sums, \(k\)-factors and Hamilton cycles in graphs
- Cycles through prescribed vertices with large degree sum
- Not every 2-tough graph is Hamiltonian
- An efficient condition for a graph to be Hamiltonian
- Cubic planar Hamiltonian graphs of various types
- Pancyclic graphs. I
- Fault-free mutually independent Hamiltonian cycles of faulty star graphs
- Note on Hamilton Circuits
- Edge disjoint cycles in graphs
- Cyclability of 3-connected graphs
- Onk-ordered graphs
- Linear forests and ordered cycles
- Degree conditions for k‐ordered hamiltonian graphs
- k-ordered Hamiltonian graphs
- Some Theorems on Abstract Graphs
This page was built for publication: On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
