Relative length of longest paths and cycles in graphs
From MaRDI portal
Publication:2385137
Recommendations
- Degree conditions and relative length of longest paths and cycles in graphs
- Relationships between the length of a longest path and the relative length
- On relative length of longest paths and cycles
- Longest paths and longest cycles in graphs with large degree sums
- Long cycles in graphs without Hamiltonian paths
Cites work
- Cycles through particular subgraphs of claw‐free graphs
- Graph theory with applications
- Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
- Longest paths and longest cycles in graphs with large degree sums
- Relative length of long paths and cycles in graphs with large degree sums
- Relative length of longest paths and cycles in 3-connected graphs
- Two sufficient conditions for dominating cycles
Cited in
(13)- Long cycles in graphs without Hamiltonian paths
- Degree sums and dominating cycles
- Degree conditions and relative length of longest paths and cycles in graphs
- Relative length of longest paths and cycles in 3-connected graphs
- Characterizing forbidden pairs for relative length of longest paths and cycles
- A note on a cycle partition problem
- Relationships between the length of a longest path and the relative length
- A bound on relative lengths of triangle-free graphs
- Longest paths and longest cycles in graphs with large degree sums
- On relative length of longest paths and cycles
- Alternating paths and cycles of minimum length
- Bounding the distance among longest paths in a connected graph
- Relative length of longest paths and longest cycles in triangle-free graphs
This page was built for publication: Relative length of longest paths and cycles in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385137)
