Implicit degree sum condition for Hamiltonian cycles.
From MaRDI portal
(Redirected from Publication:5355033)
Recommendations
- An implicit degree Dirac condition for Hamiltonian cycles.
- An implicit degree condition for Hamiltonian cycles
- Implicit degree condition for Hamiltonicity of graphs.
- An algorithm for Hamiltonian cycles under implicit degree conditions.
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
Cited in
(16)- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
- An algorithm for Hamiltonian cycles under implicit degree conditions.
- Implicit degree condition for Hamiltonicity of graphs.
- On implicit degree sum condition for long cycles.
- An implicit degree Dirac condition for Hamiltonian cycles.
- An implicit degree condition for relative length of long paths and cycles in graphs
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- scientific article; zbMATH DE number 7397946 (Why is no real title available?)
- An implicit degree condition for pancyclicity of graphs
- An implicit degree condition for Hamiltonian graphs
- scientific article; zbMATH DE number 6770098 (Why is no real title available?)
- An implicit degree condition for Hamiltonian cycles
- scientific article; zbMATH DE number 4185649 (Why is no real title available?)
- Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices
- Implicit degree condition restricted to essential independent sets for Hamiltonian cycles
- An improved degree based condition for Hamiltonian cycles
This page was built for publication: Implicit degree sum condition for Hamiltonian cycles.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5355033)
