On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem

DOI10.1016/j.ipl.2012.07.014zbMath1248.05110MaRDI 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

zbMATH Keywords

Hamiltonian; combinatorial problems; degree; Ore's theorem; 1-fault Hamiltonian

Mathematics Subject Classification ID

05C38: Paths and cycles

05C45: Eulerian and Hamiltonian graphs

05C07: Vertex degrees

Related Items

On the 1-fault hamiltonicity for graphs satisfying Ore's theorem and its generalization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Linear forests and ordered cycles
• Degree conditions for k‐ordered hamiltonian graphs
• Some Theorems on Abstract Graphs