Long paths, long cycles, and their relative length
From MaRDI portal
Publication:4229263
DOI10.1002/(SICI)1097-0118(199902)30:2%3C91::AID-JGT3%3E3.0.CO;2-8zbMATH Open0915.05077OpenAlexW4240480297MaRDI QIDQ4229263FDOQ4229263
Publication date: 23 June 1999
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199902)30:2%3C91::aid-jgt3%3E3.0.co;2-8
Recommendations
Cited In (9)
- Long cycles in graphs without Hamiltonian paths
- Length of longest cycles in a graph whose relative length is at least two
- Transversals of Longest Paths and Cycles
- Relative length of long paths and cycles in graphs with large degree sums
- On relative length of longest paths and cycles
- Generalized Turán number for linear forests
- Long Alternating Paths Exist
- Relative length of longest paths and longest cycles in triangle-free graphs
- Title not available (Why is that?)
This page was built for publication: Long paths, long cycles, and their relative length
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4229263)