Abstract

We present new kernelization results for the s-CYCLE TRANSVERSAL problem for s > 3. In particular, we show a 6k2 kernel for 4-CYCLE TRANSVERSAL and a O(ks-1) kernel for s-CYCLE TRANSVERSAL when s > 4. We prove the NP-completeness of s-CYCLE TRANSVERSAL on planar graphs and obtain a 74k kernel for 4-CYCLE TRANSVERSAL on planar graphs. We also give several kernelization results for a related problem (≤ s)-CYCLE TRANSVERSAL.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.