Degree conditions and relative length of longest paths and cycles in graphs
From MaRDI portal
Publication:6041576
DOI10.1016/J.DISC.2023.113495zbMATH Open1515.05061OpenAlexW4376960909MaRDI QIDQ6041576FDOQ6041576
Authors: Yueyu Wu 
Publication date: 31 May 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2023.113495
Recommendations
- Relative length of longest paths and cycles in graphs
- A degree sum condition with connectivity for relative length of longest paths and cycles
- Relative length of longest paths and cycles in 3-connected graphs
- Length of longest cycles in a graph whose relative length is at least two
- Relative length of long paths and cycles in graphs with large degree sums
Cites Work
Cited In (8)
- A degree sum condition with connectivity for relative length of longest paths and cycles
- Relative length of longest paths and cycles in graphs
- Characterizing forbidden pairs for 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
- Relative length of longest paths and cycles in 2-connected graphs
- A bound on relative lengths of triangle-free graphs
- Core and Conditional Core Path of Specified Length in Special Classes of Graphs
This page was built for publication: Degree conditions and 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 Q6041576)
