Abstract
The number of crossing-free Hamiltonian circuits in planar drawings of K n is studied. In particular, it is shown that for planar drawings of K n , (1) there are drawings having as many as ( 3 20 )·10 [ n 3 ] such circuits and (2) no drawing contains more than 2·6 n−2([ n 2 ])!
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.
