On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem
From MaRDI portal
Publication:456147
DOI10.1016/J.IPL.2012.07.014zbMATH Open1248.05110OpenAlexW2057381067MaRDI QIDQ456147FDOQ456147
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
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 K1, r‐free graphs
Cites Work
- Graph theory
- Pancyclic graphs. I
- Note on Hamilton Circuits
- Degree conditions for k‐ordered hamiltonian graphs
- Some Theorems on Abstract Graphs
- A new sufficient condition for hamiltonicity of graphs
- Not every 2-tough graph is Hamiltonian
- Removable matchings and Hamiltonian cycles
- Advances on the Hamiltonian problem -- a survey
- Cycles through prescribed vertices with large degree sum
- Edge disjoint cycles in graphs
- Cyclability of 3-connected graphs
- Linear forests and ordered cycles
- An improved degree based condition for Hamiltonian cycles
- On Hamiltonian cycles and Hamiltonian paths
- k-ordered Hamiltonian graphs
- A comprehensive analysis of degree based condition for Hamiltonian cycles
- A degree characterisation of pancyclicity
- Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
- Degree sums, \(k\)-factors and Hamilton cycles in graphs
- An efficient condition for a graph to be Hamiltonian
- Cubic planar Hamiltonian graphs of various types
- Fault-free mutually independent Hamiltonian cycles of faulty star graphs
- Onk-ordered graphs
- A fan-type result on \(k\)-ordered graphs
Cited In (5)
- Title not available (Why is that?)
- Degree conditions for Hamiltonicity: counting the number of missing edges
- On the existence of Hamiltonian cycles after removing edges
- On the 1-fault Hamiltonicity for graphs satisfying Ore's theorem and its generalization
- Some Hamiltonian properties of one-conflict graphs
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)
