Abstract
Let P be a set of n≥1 points in general position in R2. The edge disjointness graphD(P) of P is the graph whose vertices are all the segments with endpoints in P, two of which are adjacent in D(P) if and only if they are disjoint. In this note, we give a full characterization of all those edge disjointness graphs that are hamiltonian. More precisely, we shall show that there are exactly 9 order types of P for which D(P) is not hamiltonian. Additionally, from one of these 9 order types, we derive a counterexample to a criterion for the existence of hamiltonian cycles due to A. D. Plotnikov in 1998.
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.
