Abstract
It is a simple fact that cubic Hamiltonian graphs have at least two Hamiltonian cycles. Finding such a cycle isNP-hard in general, and no polynomial-time algorithm is known for the problem of finding a second Hamiltonian cycle when one such cycle is given as part of the input. We investigate the complexity of approximating this problem where by a feasible solution we mean a(nother) cycle in the graph, and the quality of the solution is measured by cycle length. First we prove a negative result showing that the Longest Path problem is not constant approximable in cubic Hamiltonian graphs unlessP=NP. No such negative result was previously known for this problem in Hamiltonian graphs. In strong opposition with this result we show that there is a polynomial-time approximation scheme for finding a second cycle in cubic Hamiltonian graphs if a Hamiltonian cycle is given in the input.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
