An implicit degree condition for relative length of long paths and cycles in graphs
From MaRDI portal
(Redirected from Publication:287873)
Recommendations
- scientific article; zbMATH DE number 6770098
- On implicit degree sum condition for long cycles.
- Implicit degree sum condition for Hamiltonian cycles.
- An implicit degree condition for long cycles in 2-connected graphs
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles
Cites work
Cited in
(8)- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
- On implicit degree sum condition for long cycles.
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- An implicit degree condition for long cycles in 2-connected graphs
- High-order copositive tensors and its applications
- An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
- Core and Conditional Core Path of Specified Length in Special Classes of Graphs
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles
This page was built for publication: An implicit degree condition for relative length of long paths and cycles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q287873)