An implicit degree condition for Hamiltonian graphs
From MaRDI portal
Recommendations
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
- Implicit degree sum condition for Hamiltonian cycles.
- An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
- An implicit degree Dirac condition for Hamiltonian cycles.
- An implicit degree condition for Hamiltonian cycles
Cites work
Cited in
(13)- An improved degree based condition for Hamiltonian cycles
- Downhill domination problem in graphs
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
- Hamiltonian degree conditions which imply a graph is pancyclic
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- A degree condition for Hamiltonian digraphs
- An algorithm for Hamiltonian cycles under implicit degree conditions.
- Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
- An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
- Implicit degree condition for Hamiltonicity of 2-heavy graphs
- scientific article; zbMATH DE number 6438400 (Why is no real title available?)
- Implicit degree condition restricted to essential independent sets for Hamiltonian cycles
This page was built for publication: An implicit degree condition for Hamiltonian graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q432725)
