Abstract
Let A={ C 1, C 2,…, C n } be an arrangement of Jordan curves in the plane lying in general position, i.e., every properly intersects at least one other curve, no two curves touch each other and no three meet at a common intersection point. The Jordan-curve arrangement graph of A has as its vertices the intersection points of the curves in A, and two vertices are connected by an edge if their corresponding intersection points are adjacent on some curve in A. We further assume A is such that the resulting graph has no multiple edges. Under these conditions it is shown that determining whether Jordan-curve arrangement graphs are Hamiltonian is NP-complete.
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.
