-
1
Packing 1-plane Hamiltonian cycles in complete geometric graphs
Published 2019“…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]. …”
Get full text
Article -
2
On some packing and partition problems in geometric graphs
Published 2018“…An algorithm for computing such 1-plane Hamiltonian cycles is also presented.…”
Get full text
Thesis