Long cycles in graphs without Hamiltonian paths
From MaRDI portal
(Redirected from Publication:998320)
Recommendations
Cites work
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- Longest paths and longest cycles in graphs with large degree sums
- On relative length of longest paths and cycles
- Relative length of long paths and cycles in graphs with large degree sums
- Relative length of longest paths and cycles in 3-connected graphs
- Relative length of longest paths and cycles in graphs
- Relative lengths of paths and cycles in 3-connected graphs
Cited in
(10)- scientific article; zbMATH DE number 3849265 (Why is no real title available?)
- Some results on graphs without long induced paths
- Relative length of longest paths and cycles in graphs
- A bound on relative lengths of triangle-free graphs
- A degree sum condition for graphs to be covered by two cycles
- Finding long paths and cycles in sparse Hamiltonian graphs
- On longest non-Hamiltonian cycles in digraphs with the conditions of Bang-Jensen, Gutin and Li
- On relative length of longest paths and cycles
- Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle
- scientific article; zbMATH DE number 1744069 (Why is no real title available?)
This page was built for publication: Long cycles in graphs without Hamiltonian paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998320)