Packing 1-plane Hamiltonian cycles in complete geometric graphs

Counting the number of Hamiltonian cycles that are contained in a geometric graph is #P-complete even if the graph is known to be planar [15]. A relaxation for problems in plane geometric graphs is to allow the geometric graphs to be 1-plane, that is, each of its edges is crossed at most once. We co...

Full description

Bibliographic Details
Main Authors: Trao, Hazim Michman, Ali, Niran Abbas, Chia, Gek L., Kilicman, Adem
Format: Article
Language:English
Published: Faculty of Sciences and Mathematics, University of Nis 2019
Online Access:http://psasir.upm.edu.my/id/eprint/81605/1/PLANE.pdf