Relative length of longest paths and cycles in graphs
From MaRDI portal
Publication:2385137
DOI10.1007/S00373-007-0740-1zbMATH Open1125.05057OpenAlexW2051880482MaRDI QIDQ2385137FDOQ2385137
Mei Lu, Feng Tian, Huiqing Liu
Publication date: 11 October 2007
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-007-0740-1
Cites Work
- Title not available (Why is that?)
- Relative length of long paths and cycles in graphs with large degree sums
- Two sufficient conditions for dominating cycles
- Cycles through particular subgraphs of claw‐free graphs
- Relative length of longest paths and cycles in 3-connected graphs
- Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree
- Longest paths and longest cycles in graphs with large degree sums
Cited In (10)
- Long cycles in graphs without Hamiltonian paths
- Degree conditions and relative length of longest paths and cycles in graphs
- Bounding the distance among longest paths in a connected graph
- Characterizing forbidden pairs for relative length of longest paths and cycles
- On relative length of longest paths and cycles
- Relative length of longest paths and longest cycles in triangle-free graphs
- Relative length of longest paths and cycles in 3-connected graphs
- A note on a cycle partition problem
- Alternating paths and cycles of minimum length
- Degree sums and dominating cycles
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)
