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

DOI10.1016/J.IPL.2012.07.014MaRDI QIDQ456147zbMATHOpenAlexFDO

Authors 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

Hamiltoniancombinatorial problemsdegreeOre's theorem1-fault Hamiltonian

Mathematics Subject Classification ID

Vertex degrees (05C07) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Recommendations

• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem and its generalization
• scientific article; zbMATH DE number 975394
• Total vertex irregularity strength of 1-fault tolerant Hamiltonian graphs
• A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
• An Ore-type condition for Hamiltonicity in tough graphs
• Some Hamiltonian properties of one-conflict graphs
• On hamiltonicity of 1-tough triangle-free graphs
• scientific article; zbMATH DE number 1750093
• Conditional fault Hamiltonicity of the complete graph
• Hamiltonicity for K_{1, r}‐free graphs

Cites work

• A comprehensive analysis of degree based condition for Hamiltonian cycles
• A degree characterisation of pancyclicity
• A fan-type result on \(k\)-ordered graphs
• A new sufficient condition for hamiltonicity of graphs
• Advances on the Hamiltonian problem -- a survey
• An efficient condition for a graph to be Hamiltonian
• An improved degree based condition for Hamiltonian cycles
• Cubic planar Hamiltonian graphs of various types
• Cyclability of 3-connected graphs
• Cycles through prescribed vertices with large degree sum
• Degree conditions for k‐ordered hamiltonian graphs
• Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
• Degree sums, \(k\)-factors and Hamilton cycles in graphs
• Edge disjoint cycles in graphs
• Fault-free mutually independent Hamiltonian cycles of faulty star graphs
• Graph theory
• Linear forests and ordered cycles
• Not every 2-tough graph is Hamiltonian
• Note on Hamilton Circuits
• On Hamiltonian cycles and Hamiltonian paths
• Onk-ordered graphs
• Pancyclic graphs. I
• Removable matchings and Hamiltonian cycles
• Some Theorems on Abstract Graphs
• k-ordered Hamiltonian graphs

Cited in

(5)

• Some Hamiltonian properties of one-conflict graphs
• Degree conditions for Hamiltonicity: counting the number of missing edges
• On the existence of Hamiltonian cycles after removing edges
• scientific article; zbMATH DE number 3924825 (Why is no real title available?)
• On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem and its generalization

This page was built for publication: On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456147)