A new sufficient condition for Hamiltonian graphs
From MaRDI portal
(Redirected from Publication:1005735)
Recommendations
Cites work
Cited in
(26)- A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity
- A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
- New Ore's type results on hamiltonicity and existence of paths of given length in graphs
- An efficient condition for a graph to be Hamiltonian
- New sufficient condition for Hamiltonian graphs
- New local conditions for a graph to be Hamiltonian
- An improvement of Bondy's theorem on Hamilton graph condition
- A neighborhood condition for vertices at distance two implying Hamiltonicity
- scientific article; zbMATH DE number 147627 (Why is no real title available?)
- scientific article; zbMATH DE number 540116 (Why is no real title available?)
- scientific article; zbMATH DE number 1159754 (Why is no real title available?)
- New sufficient condition and Hamiltonian and traceable
- scientific article; zbMATH DE number 786156 (Why is no real title available?)
- scientific article; zbMATH DE number 811601 (Why is no real title available?)
- A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture
- New necessary and sufficient condition and algorithm for directed hamiltonian graph based on boolean determinant theory
- scientific article; zbMATH DE number 2201267 (Why is no real title available?)
- Fan type condition and characterization of Hamiltonian graphs
- Variations on a sufficient condition for Hamiltonian graphs
- scientific article; zbMATH DE number 5036076 (Why is no real title available?)
- Long cycles in certain graphs of large degree
- Vertex pancyclicity and new sufficient conditions
- Four sufficient conditions for hamiltonian graphs
- A new sufficient condition for hamiltonicity of graphs
- Degree with neighborhood conditions and highly Hamiltonian graphs
This page was built for publication: A new sufficient condition for Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1005735)